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

Q. A character of the data that binary search uses but the linear search ignores, is

View solution

Q. Which of the following is useful in implementing quick sort?

View solution

Q. A________search begins the search with the element that is located in the middle of the array.

View solution

Q. The time complexity of linear search algorithm over an array of n elements is

View solution

Q. Which of the following algorithms exhibits the unnatural behavior that, minimum number of comparisons are needed if the list to be sorted is in the reverse sorted order and maximum number of comparisons are needed if they are already in sorted order?

View solution

Q. Which of the following sorting algorithm has the worst time complexity of n log(n)?

View solution

Q. Which of the following sorting methods sorts a given set of items that is already in sorted order or in reverse sorted order with equal speed?

View solution

Q. The average time required to perform a successful sequential search for an element in an array A(1 : n) is given by

View solution

Q. Which of the following is false ?

View solution