Practice Set 2 question answer - computer mcq Online Quiz (set-1) For All Competitive Exams
Q-1) 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-2) The complexity of Bubble sort algorithm is
(a)
(b)
(c)
(d)
Q-3) The term “push” and “pop” is related to the
(a)
(b)
(c)
(d)
Q-4) The following data structure allows deleting data elements from front and inserting at rear
(a)
(b)
(c)
(d)
Q-5) Which of the following data structure is not linear data structure?
(a)
(b)
(c)
(d)
Q-6) The following data structure is non-linear type
(a)
(b)
(c)
(d)
Q-7) The following data structure is linear type
(a)
(b)
(c)
(d)
Q-8) If every node u in G is adjacent to every other node v in G, A graph is said to be
(a)
(b)
(c)
(d)
Q-9) Finding the location of the element with a given value is called
(a)
(b)
(c)
(d)
Q-10) 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)