Classical

Data Structures - Sorting & Searching

16:  

 Which of the following sorting procedure is the slowest ?

A.

Quick sort

B.

Heap sort

C.

Shell sort

D.

Bubble sort

 
 

Option: D

Explanation :


17:  

 Which of the following sorting method is stable ?

A.

Straight insertion sort

B.

Binary insertion sort

C.

Shell sort

D.

Heap sort

 
 

Option: A

Explanation :


18:  

Which of the following best describes sorting ?

A.

Accessing and processing each record exactly once

B.

Finding the location of the record with a given key

C.

Arranging the data (record) in some given order

D.

Adding a new record to the data structure

 
 

Option: C

Explanation :


19:  

A sort which compares adjacent elements in a list and switches where necessary is

A.

insertion sort

B.

heap sort

C.

quick sort

D.

bubble sort

 
 

Option: D

Explanation :


20:  

A sort which iteratively passes through a list to exchange the first element with any element less than it and then repeats with a new first element is called

A.

insertion sort

B.

selection sort

C.

heap sort

D.

quick sort

 
 

Option: B

Explanation :




Suggest an improvement