MCQ 1 When new data are to be inserted into a data structure, but there is not available space; this situation is usually called ______________.

(A) Underflow (B) overflow (C) houseful (D) saturated

MCQ 2 A linear collection of data elements where the linear node is given by means of pointer is called

(A) linked list (B) node list (C) primitive list (D) None of these

MCQ 3 Which of the following data structure is not linear data structure?

(A) Arrays (B) Linked lists (C) Both of above (D) None of the above

MCQ 4 Two main measures for the efficiency of an algorithm are ________________.

(A) processor and memory (B) complexity and capacity (C) time and space (D) data and space

MCQ 5 The operation of processing each element in the list is known as ____________.

(A) Sorting (B) Merging (C) Inserting (D) Traversal

MCQ 6 Each array declaration need not give, implicitly or explicitly, the information about

(A) the name of array (B) the data type of array (C) the first data from the set to be stored (D) the index set of the array

MCQ 7 The complexity of Binary search algorithm is

(A) O(n) (B) O(log ) (C) O(n²) (D) O(n log n)

MCQ 8 Any node is the path from the root to the node is called?

(A) Successor node (B) Ancestor node (C) Internal node (D) None of the above

MCQ 9 The word "Stack" is also known as ______________.

(A) Last in first out (B) First in last out (C) Last in last out (D) First in first out

MCQ 10 The Average case occur in linear search algorithm.

(A) When Item is somewhere in the middle of the array (B) When Item is not in the array at all (C) When Item is the last element in the array (D) When Item is the last element in the array or is not there at all

MCQ 11 The advantage of ________________ is that they solve the problem if sequential storage representation. But disadvantage in that is they are sequential lists.

(A) Lists (B) Linked Lists (C) Trees (D) Queues

MCQ 12 Other name for directed graph is ______________ .

(A) Direct graph (B) Digraph (C) Dir-graph (D) Digraph

MCQ 13 The condition ______________ indicate the queue is empty.

(A) Front = Null (B) Null = Front (C) Front = Rear (D) Rear = Null

MCQ 14 The various operations that can be performed on stacks is/are

(A) Insert an item into the stack (B) Delete an item from the stack (C) Display the contents of the stack (D) All of the above

MCQ 15 Very slow way of sorting is _____________.

(A) Insertion sort (B) Heap sort (C) Bubble sort (D) Quick sort

MCQ 16 Reversing a great deal of space for each stack in memory will be.

(A) Decrease the numbers of times overflow may occur (B) Increase the numbers of times overflow may occur (C) Increase the number of times underflow may occur (D) Increase the number of times underflow may occur

MCQ 17 Link fields holds pointers to the ____________ element in the linked representation of stack.

(A) middle (B) last (C) first (D) neighboring

MCQ 18 The data structure which is one ended is _____________.

(A) queue (B) stack (C) tree (D) graph

MCQ 19 Which indicates pre-order traversal?

(A) Left sub-tree, Right sub-tree and root (B) Right sub-tree, Left sub-tree and root (C) Root, Left sub-tree, Right sub-tree (D) Right sub-tree, root, Left sub-tree

MCQ 20 ____________ sorting is good to use when alphabetizing large list of names.

(A) Merge (B) Heap (C) Radix (D) Bubble

MCQ 21 The total number of comparisons in a bubble sort is ______________.

(A) O(n logn) (B) O(2n) (C) O(n²) (D) O(n)

MCQ 22 The easiest sorting is _________________.

(A) quick sort (B) shell sort (C) heap sort (D) selection sort

MCQ 23 Quick sort is also known as _________________

(A) merge sort (B) tree sort (C) partition and exchange sort (D) shell sort

MCQ 24 Sorting a file F usually refers to sorting F with respect to a particular key called _______________

(A) Basic key (B) Primary key (C) Starting key (D) Index key

MCQ 25 Which of the following sorting algorithm is of priority queue sorting type?

(A) Bubble sort (B) Insertion sort (C) Merge sort (D) Selection sort