# Data Structures and Algorithms Multiple Choice Questions - Set 21

201.       Which of the following is an example of dynamic programming approach?
(A) Fibonacci Series
(B) Tower of Hanoi
(C) Dijkstra’s Shortest Path
(D) All of the above
202.       A queue data-structure can be used for ...............
(A) expression parsing
(B) recursion
(C) resource allocation
(D) all of these
203.       The maximum degree of any vertex in a simple graph with n vertices is:
(A) n–1
(B) n+1
(C) 2n–1
(D) n
204.       The data structure required for Breadth First Traversal on a graph is .............
(A) Queue
(B) Stack
(C) Array
(D) Tree
205.       The quick sort algorithm exploit ................. design technique.
(A) Greedy
(B) Dynamic programming
(C) Divide and Conquer
(D) Backtracking
206.       The number of different directed trees with 3 nodes are:
(A) 2
(B) 3
(C) 4
(D) 5
207.       One can convert a binary tree into its mirror image by traversing it in
(A) in-order
(B) pre-order
(C) post-order
(D) any order
208.       The total number of comparisons required to merge 4 sorted files containing 15, 3, 9 and 8 records into a single sorted file is .............
(A) 66
(B) 39
(C) 15
(D) 3
Ans: ?
209.       Minimum number of moves required to solve a Tower of Hanoi puzzle is ..............
(A) 2^n2
(B) 2n-1
(C) 2n - 1
(D) 2n - 1