Q. Which of the following is an example of in-place algorithm?

View solution

Q. The average case of quick sort has order

View solution

Q. Which sorting algorithm is the best if the list is already in order?

View solution

Q. The number of comparisons required to sort 5 numbers in ascending order using bubble sort is

View solution

Q. The second largest number from a set of n distinct numbers can be found in

View solution

Q. The sort which inserts each elements A(K) into proper position in the previously sorted sub array A(1), ..., A(K–1)

View solution

Q. Shell sort uses ................

View solution

Q. A desirable choice for the partitioning element in quick sort is

View solution

Q. Out of the following, the slowest sorting procedure is

View solution

Q. The minimum number of comparisons required to find the largest number from 4 different numbers are

View solution

Q. A sorting algorithm is stable if

View solution

Q. For a binary search algorithm to work, it is necessary that the array must be ............

View solution

Q. Match the following:

List - I
i. Bubble Sort  
ii. Shell Sort     
iii. Selection Sort   
     
List - II
a. Ο(n)
b. Ο(n2)
c. Ο(n log n)

View solution

Q. The largest and the second largest number from a set of n distinct numbers can be found in

View solution

Q. Hashing collision resolution techniques are:

View solution

Q. After each iteration in bubble sort:

View solution

Q. The running time of the following sorting algorithm depends on whether the partitioning is balanced or unbalanced.

View solution

Q. The average case complexity of Insertion Sort is

View solution

Q. Linear search is highly inefficient compared to binary search when dealing with:

View solution

Q. A sorted file contains 16 items. Using binary search, the maximum number of comparisons to search for an item in this file is ...........

View solution