MCQ 1 The complexity of merge sort algorithm is _____________
MCQ 2 When determining the efficiency of algorithm, the space factor is measured by
MCQ 3 In linear search algorithm the worst case occurs when?
MCQ 4 The property of binary tree is
MCQ 5 Which data structure is used in breadth first search of a graph to hold nodes?
MCQ 6 A variable P is called pointer if
MCQ 7 Any node is the path from the root to the node is called?
MCQ 8 Linked lists are best suited
MCQ 9 Herder node is used as sentinel in _________________.
MCQ 10 In a stack, if a user tries to remove an element from empty stack it is called ________________.
MCQ 11 ____________ is very useful in situation when data have to stored and then retrieved in reverse order.
MCQ 12 When inorder traversing a tree resulted E A C K F H D B G; the preorder traversal would return
MCQ 13 If the values of a variable in one module is indirectly changed by another module, this situation is called
MCQ 14 Which of the following is not a limitation of binary search algorithm?
MCQ 15 An adjacency matrix representation of a graph cannot contain information of
MCQ 16 Which is/are the application(s) of stack?
MCQ 17 Which of the following applications may use a stack?
MCQ 18 Which of the following data structure can’t store the non-homogeneous data elements?
MCQ 19 Which data structure allows deleting data elements from and inserting at rear?
MCQ 20 Which of the following statement is false?
MCQ 21 Which of the following is/are the levels of implementation of data structure
MCQ 22 The type of expression in which operator succeeds its operands is?
MCQ 23 In general, the binary search method needs no more than _____________ comparisons.
MCQ 24 A graph is a collection of nodes, called ________________ and line segments called arcs or ________________ that connect pair of nodes.
MCQ 25 In the ____________ traversal we process all of a vertex’s descendants before we move to an adjacent vertex.