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

Q. In worst case Quick Sort has order

View solution

Q. A sort which relatively passes through a list to exchange the first element with any element less than it and then repeats with a new first element is called

View solution

Q. Which of the following sorting algorithms does not have a worst case running time of O (n^2) ?

View solution

Q. The quick sort algorithm exploit _________ design technique.

View solution

Q. The total number of companions required to merge 4 sorted files containing 15, 3, 9 and 8 records into a single sorted file is

View solution

Q. The complexity of searching an element from a set of n elements using Binary search algorithm is

View solution

Q. Which of the following sorting methods would be most suitable for sorting a list which is almost sorted

View solution

Q. Quick sort is also known as

View solution

Q. The goal of hashing is to produce a search that takes

View solution

Q. The best average behaviour is shown by

View solution

Q. Consider that n elements are to be sorted. What is the worst case time complexity of Bubble sort?

View solution

Q. A characteristic of the data that binary search uses but the linear search ignores is the___________.

View solution

Q. Which of the following sorting algorithm is stable ?

View solution

Q. In binary search, average number of comparison required for searching an element in a list if n numbers is

View solution

Q. The worst case of quick sort has order

View solution

Q. Which technique is suitable for performing a search in a small array or in an unsorted array?

View solution

Q. What finds the largest element in the array, and puts it in the proper place?

View solution

Q. Which array is the fastest on an average, but sometimes unbalanced partitions can lead to very slow sorting?

View solution