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

Q. The average number of key comparisons done in successful sequential search in a list of length n is ..............

View solution

Q. The sorting technique where array to be sorted is partitioned again and again in such a way that all elements less than or equal to partitioning element appear before it and those which are greater appear after it, is called ..............

View solution

Q. The search technique for searching a sorted file that requires increased amount of space is ................

View solution

Q. For merging two sorted lists of sizes m and n into a sorted list of size m + n, we require comparisons of

View solution

Q. Which of the following algorithm design technique is used in the quick sort algorithm?

View solution

Q. The average search time of hashing, with linear probing will be less if the load factor

View solution

Q. Heap allocation is required for languages

View solution