# Data Structures and Algorithms Multiple Choice Questions - Set 19

181.       The worst case complexity of binary search matches with ...............
(A) interpolation search
(B) linear search
(C) merge sort
(D) none of the above
182.       A binary tree in which if all its levels except possibly the last, have the maximum number of nodes and all the nodes at the last level appear as far left as possible, is known as
(A) full binary tree
(B) AVL tree
(D) complete binary tree
183.       A linear list of elements in which deletion can be done from one end (front) and insertion
can take place only at the other end (rear) is known as a .................
(A) Queue
(B) Stack
(C) Tree
184.       What is the postfix form of the following prefix expression -A/B*C\$DE ?
(A) ABCDE\$*/-
(B) A-BCDE\$*/-
(C) ABC\$ED*/-
(D) A-BCDE\$*/
185.       The following formula will produce:
Fn = Fn-1 + Fn-2
(A) Armstrong Number
(B) Fibonacci Series
(C) Euler Number
(D) Prime Number
186.       All possible spanning trees of graph G:
(A) have same number of edges and vertices.
(B) have same number of edges and but not vertices.
(C) have same number of vertices but not edges.
(D) depends upon algorithm being used.
187.       A full binary tree with n leaves contains .............
(A) n nodes
(B) log n2 nodes
(C) 2n –1 nodes
(D) 2n nodes
188.       The Θ notation in asymptotic evaluation represents ...........
(A) Base case
(B) Average case
(C) Worst case
(D) NULL case
189.       A sort which relatively passes through a list to exchange the first element with any element less than it and then repeats with a new first element is called ................
(A) Insertion sort
(B) Selection sort
(C) Heap sort
(D) Quick sort