Linear Time Sorting
1.

The Sorting method which is used for external sort is
A.  Bubble sort B.  Quick sort C.  Merge sort D.  Radix sort E.  Selection sort.
2.

What is not true about insertion sort?
A.  

Exhibits the worst case performance when the initial array is sorted in reverse order.

 B.  

Worst case and average case performance is Ο(n2)

 C.  

Can be compared to the way a card player arranges his card from a card deck.

 E.  

None of the above.
3.

Which of the following has search efficiency of Ο(1) −
A.  

Tree

 B.  

Heap

 C.  

Hash Table

 D.  

Linked-List
4.

Which of the below given sorting techniques has highest best-case runtime complexity
A.  

quick sort

 B.  

selection sort

 C.  

insertion sort

 D.  

bubble sort
5.

Which of the below given sorting techniques has highest best-case runtime complexity
A.  

quick sort

 B.  

selection sort

 C.  

insertion sort

 D.  

bubble sort
6.

How many swaps are required to sort the given array using bubble sort - { 2, 5, 1, 3, 4} ?
A.  

4

 B.  

5

 C.  

6

 D.  

7
7.

An adaptive sorting algorithm −
A.  

adapts to new computers.

 B.  

takes advantage of already sorted elements.

 C.  

takes input which is already sorted.

 D.  

none of the above.
8.

15. Which of the following algorithm takes non linear time for sorting?
A.  

counting sort

 B.  

quick sort

 C.  

bucket sort

 D.  

radix sort