The worst case complexity of linear search is _______

What is the best case time complexity of merge sort?

If the list has n numbers and the largest number has m digits, then the radix sort algorithm requires ____ passes to give the output.

If the bubble sort algorithm gets a list in descending order as input, it will perform ________ number swaps.

The selection sort algorithm finds the largest element in the list and swap it with the last element. State true or false.

Which of the following algorithms work similar to the way in which the playing cards are sorted?

Identify the algorithm that uses divide and conquer method

The quick sort algorithm splits the list into equal halves in each and every partitioning. State true or false.

In the brute-force string matching algorithm, the number of characters by which the pattern will be shifted towards right on a mismatch is ______

Quadratic probing is an example of

Which of the following can not be the load factor in closed hashing?

Identify the index at which the data element 15 will be stored in a hash table of size 7 when linear probing is used for collision resolution and if 8 and 22 are already inserted.

If the pattern is not found in the text, the string matching algorithm will return ____

The merge sort algorithm divides the list into sub lists until we get a list with ____ number of elements.