Practice Data structures and algorithms - computer mcq Online Quiz (set-1) For All Competitive Exams
Q-1) The complexity of Binary search algorithm is
(a)
(b)
(c)
(d)
Q-2) The complexity of merge sort algorithm is
(a)
(b)
(c)
(d)
Q-3) In a binary tree, certain null entries are replaced by special pointers which point to nodes higher in tree for efficiency. These special pointers are called
(a)
(b)
(c)
(d)
Q-4) The complexity of Bubble sort algorithm is
(a)
(b)
(c)
(d)
Q-5) Which of the following data structure is linear data structure?
(a)
(b)
(c)
(d)
Q-6) The following data structure allows deleting data elements from front and inserting at rear
(a)
(b)
(c)
(d)
Q-7) Which of the following data structure is not linear data structure?
(a)
(b)
(c)
(d)
Q-8) The operation of processing each element in the list is known as
(a)
(b)
(c)
(d)
Q-9) The following data structure is non-linear type
(a)
(b)
(c)
(d)
Q-10) The following data structure is linear type
(a)
(b)
(c)
(d)
Q-11) When in order traversing a tree resulted E A C K F H D B G; the preorder traversal would return
(a)
(b)
(c)
(d)
Q-12) The following name does not relate to stacks
(a)
(b)
(c)
(d)
Q-13) A connected graph T without any cycles is called
(a)
(b)
(c)
(d)
Q-14) The following sorting algorithm is of divideand-conquer type
(a)
(b)
(c)
(d)
Q-15) A data structure where elements can be added or removed at either end but not in the middle is referred as
(a)
(b)
(c)
(d)
Q-16) Two main measures for the efficiency of an algorithm are
(a)
(b)
(c)
(d)
Q-17) In a graph if e=[u, v], Then u and v are called
(a)
(b)
(c)
(d)
Q-18) The indirect change of the values of a variable in one module by another module is called
(a)
(b)
(c)
(d)
Q-19) Each data item in a record may be a group item composed of sub-items; those items which are indecomposable are called
(a)
(b)
(c)
(d)
Q-20) Binary search algorithm cannot be applied to
(a)
(b)
(c)
(d)