Data structures & Algorithms MCQ Set 3

1.       Quick sort efficiency can be improved by adopting

A.      non-recursive method

B.      insertion method

C.      tree search method

D.      None of the above

2.       For the improvement of efficiency of quick sort the pivot can be

A.      the first element

B.      the mean element

C.      the last element

D.      None of the above

E.        

3.       Quick sort is the fastest available method of sorting because of

A.      low over head

B.      O(n log n) comparisons

C.      low overhead and also O(n log n) comparisons

D.      None of the above

4.       Straight selection sort is basically a method of repeated

A.      interchange

B.      searching

C.      position adjustment

D.      None of the above

5.       Number of selections required to sort a file of size N by straight selection requires

A.      N - 1

B.      log N

C.      O(N2)

D.      None of the above

6.        For sorting a file of size n by straight selection sort, the number of comparisons made in the first pass is

A.      n

B.      n - 1

C.      n(n - 1)/2

D.      None of the above

E.        

7.       Heap is defined to be a

A.      complete binary tree

B.      binary tree

C.      tree structure

D.      None of the above

E.        

8.        In a Max heap the largest key is at

A.      the root

B.      a leaf

C.      a node

D.      None of the above

9.       In heap sort the input is arranged in the form of a

A.      heap

B.      tree

C.      queue

D.      None of the above

10.     Heap sort is found to be very efficient

A.      with regard to storage requirement

B.      in time consumption

C.      regarding overheads involved

D.      None of the above

Answers

1.a

2.b

3.c

4.c

5.a

6.b

7.a

8.a

9.a

10.a