A. A pivot element to partition unsorted list is used in:

 

a. Selection sort             b. Merge sort

c. Insertion sort              d. Quick sort

B. Which strategy is used by merge sort?

a. Divide and conquer      b. Divide

c. Greedy approach          d. None of the above

D. If a list is sorted or nearly in a sorted order then which algorithm gives a better performance?

a. Selection sort              b. Insertion sort

c. Quick sort                   d. Merge sort

E. Which search algorithm requires the list to be in a sorted order?

a. Linear search           b. Binary search

c. Both a and b            d. None of the above

F. The best case while searching an element in a binary search is __________________.

a. Element found at fi rst position b. Element found at last position

c. Element found at middle position d. None of the above