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

View solution

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

View solution

Q. An adaptive sorting algorithm −

View solution

Q. The following sorting algorithms maintain two sub-lists, one sorted and one to be sorted −

View solution

Q. The worst case complexity of binary search matches with −

View solution

Q. The number of comparisons done by sequential search is ………………

View solution

Q. In ……………, search start at the beginning of the list and check every element in the list.

View solution

Q. State True or False.

i) Binary search is used for searching in a sorted array.

ii) The time complexity of binary search is O(logn).

View solution

Q. Which of the following is not the internal sort?

View solution

Q. In general, the binary search method needs no more than ……………. comparisons.

View solution

Q. The Worst case occur in linear search algorithm when

View solution

Q. The Average case occur in linear search algorithm

View solution

Q. Which of the following is not the required condition for binary search algorithm?

View solution

Q. Which of the following is not a limitation of binary search algorithm?

View solution

Q. Binary search algorithm can not be applied to

View solution

Q. If h is any hashing function and is used to hash n keys in to a table of size m, where n<=m, the expected number of collisions involving a particular key x is :

View solution

Q. You have to sort a list L consisting of a sorted list followed by a few “random” elements. Which of the following sorting methods would be especially suitable for such a task?

View solution

Q. A technique for direct search is

View solution

Q. The searching technique that takes O (1) time to find a data is

View solution

Q. The number of interchanges required to sort 5, 1, 6, 2 4 in ascending order using Bubble Sort is

View solution