Practice Data structures and algorithms - computer mcq Online Quiz (set-2) For All Competitive Exams
Q-1) To represent hierarchical relationship between elements, the following data structure is not suitable
(a)
(b)
(c)
(d)
Q-2) The term “push” and “pop” is related to the
(a)
(b)
(c)
(d)
Q-3) The post order traversal of a binary tree is DEBFCA. Find out the pre order traversal
(a)
(b)
(c)
(d)
Q-4) The following data structure store the homogeneous data elements
(a)
(b)
(c)
(d)
Q-5) The following data structure can’t store the non-homogeneous data elements
(a)
(b)
(c)
(d)
Q-6) 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-7) 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-8) The situation when in a linked list START=NULL is
(a)
(b)
(c)
(d)
Q-9) An algorithm that calls itself directly or indirectly is known as
(a)
(b)
(c)
(d)
Q-10) Finding the location of the element with a given value is called
(a)
(b)
(c)
(d)
Q-11) The memory address of the first element of an array is called
(a)
(b)
(c)
(d)
Q-12) The in order traversal of tree will yield a sorted listing of elements of tree in
(a)
(b)
(c)
(d)
Q-13) Each array declaration need not give, implicitly or explicitly, the information about the
(a)
(b)
(c)
(d)
Q-14) Two dimensional arrays are also called
(a)
(b)
(c)
(d)
Q-15) Which of the following data structures are indexed structures
(a)
(b)
(c)
(d)
Q-16) The following is two-way list
(a)
(b)
(c)
(d)
Q-17) A binary tree whose every node has either zero or two children is called
(a)
(b)
(c)
(d)
Q-18) This data structure allows deletions at both ends of the list but insertion at only one end.
(a)
(b)
(c)
(d)
Q-19) In a graph if e=(u, v) means
(a)
(b)
(c)
(d)
Q-20) When converting binary tree into extended binary tree, all the original nodes in binary tree are
(a)
(b)
(c)
(d)