Q. Which is the easiest and least efficient searching technique?

View solution

Q. The average searching time for Fibonacci search is__________.

View solution

Q. Fibonaccian search, also referred to as Fibonacci search, is a ________algorithm for searching a sorted array by narrowing possible locations to progressively smaller intervals.

View solution

Q. At most, how many comparisons are required to search a sorted vector of 1023 elements using the binary search algorithm?

View solution

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