Q 1 - A procedure that calls itself is called

A. illegal call
B. reverse polish
C. recursive
D. none of the above
Correct Ans: C

Q 2 - An algorithm is
A. a piece of code to be executed.
B. a loosely written code to make final code.
C. a step by step procedure to solve problem.
D. all of the above.
Correct Ans: C

Q 3 - Which of the following is not possible with an array in C programming langauge −

A. Declaration
B. Definition
C. Dynamic Allocation
D. Array of strings
Correct Ans: C

Q 4 - A circular linked list can be used for

A. Stack
B. Queue
C. Both Stack & Queue
D. Neither Stack or Queue
Correct Ans: C

Q 5 - Which one of the below mentioned is linear data structure −

A. Queue
B. Stack
C. Arrays
D. All of the above
Correct Ans: D

Q6 Which linear structure has a provision of Last-In-First-Out (LIFO) mechanism for

its elements?
A. Stack
B. Queue
C. Both a & b
D. None of the above
Correct Ans: A

Q7 Traversal of a linked list always starts from the __________.

 A. First Node
B. Middle Node
C. Last Node
D. None of the Above
Correct Ans: A

Q8) Doubly Linked List is especially applicable, for which of the following
implementation?
A. Double Ended Queue
B. Linear List of Integers
C. Variable Length String Data Structure
D. All of the Above
Correct Ans: D

Q9 Which of the following sorting methods would be most suitable for sorting a list?
A. Bubble Sort
B. Insertion Sort
C. Selection Sort
D. Quick Sort
Correct Ans: A

Q10) The operation of processing each element in the list is known as, _________.
A. Sorting
B. Merging
C. Inserting
D. Traversal
Correct Ans: D

Q11) You have to sort a list L consisting of a sorted list, followed by a few “ random ”
elements. Which of the following sorting methods would be especially suitable for such a
task?
A. Bubble sort
B. Selection sort
C. Quick sort
D. Insertion sort
Correct Ans: D

Q12) What is the difference between Linear Array and a Record?

A. An array is suitable for homogeneous data but the data items in a record may have
different data type.
B. In a record, there may not be a natural ordering in opposed to linear array.
C. A record form a hierarchical structure but a linear array does not
D. All of above
Correct Ans: D

Q13) Why the elements of an Array are stored successively in Memory Cells?
 A. by this way computer can keep track only the address of the first element and the
addresses of the other elements can calculated
B. the architecture of computer memory does not allow arrays to store other than serially
C. Both of above
D. None of above
Correct Ans: A

Q14) What should we call a binary tree whose every node has either zero or two
children?
A. Complete Binary Tree
B. Binary Search Tree
C. Extended Binary Tree
D. None of Above
Correct Ans: C

15) Which of the following is the fastest ways to store and retrieve data?
A. Sorting
B. Hashing
C. Indexing
D. both A and C
Correct Ans: B