1. Linked list are not suitable data structure of which one of the following problems ?

[A] Insertion sort

[B] Binary search
[C] Radix sort
[D] Polynomial manipulation
Answer: B. Binary search
2. Which of the following algorithm design technique is used in the quick sort algorithm?

[A] Dynamic programming

[B] Backtracking
[C] Divide and conquer
[D] Greedy method
Answer: C. Divide and conquer
3. Merge sort uses ?

[A] Divide and conquer strategy

[B] Backtracking approach
[C] Heuristic search
[D] Greedy approach
Answer: A. Divide and conquer strategy
4. Which of the following is useful in traversing a given graph by breadth first search?

[A] Stack
[B] Set
[C] List
[D] Queue
Answer: D. Queue
5. Which of the following is useful in implementing quick sort?

[A] Stack
[B] Set
[C] List
[D] Queue
Answer: A. Stack
6. What is the result of the following operation Top (Push (S, X))

[A] X
[B] null
[C] s
[D] none of these

Answer: A. X
7. Queue can be used to implement ?
[A] quick sort
[B] merge sort
[C] heap sort
[D] insertion sort
Answer: A. quick sort
8. Sparse matrices have ?
[A] no zero
[B] many zero
[C] higher dimenstion
[D] none
Answer: B. many zero
9. A vertex of degree one is called
[A] padent
[B] isolated vertex
[C] null vertex
[D] colored vertex
Answer: A. padent