Practice Set 1 question answer - 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) Which of the following data structure is linear data structure?
(a)
(b)
(c)
(d)
Q-4) To represent hierarchical relationship between elements, the following data structure is not suitable
(a)
(b)
(c)
(d)
Q-5) The post order traversal of a binary tree is DEBFCA. Find out the pre order traversal
(a)
(b)
(c)
(d)
Q-6) The following data structure store the homogeneous data elements
(a)
(b)
(c)
(d)
Q-7) The following data structure can’t store the non-homogeneous data elements
(a)
(b)
(c)
(d)
Q-8) The operation of processing each element in the list is known as
(a)
(b)
(c)
(d)
Q-9) When new data are to be inserted into a data structure, but there is no available space; this situation is usually called
(a)
(b)
(c)
(d)
Q-10) The situation when in a linked list START=NULL is
(a)
(b)
(c)
(d)