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

Q. In computer science, what is of immense importance and is one of the most extensively researched subjects?

View solution

Q. It is estimated that around __________ of all CPU cycles are used to sort data?

View solution

Q. In which field, a sorting algorithm refers to an algorithm the function of which is to put elements of a list in a certain order?

View solution

Q. Which of the following statements is correct?

(i) Sorting is also often used to produce human-readable output.
(ii) The output should not be a permutation or reordering of the input.

View solution

Q. The analysis of bubble sort was done as early as_____________.

View solution

Q. ___________ is a method of arranging keys in a file in the ascending or descending order.

View solution

Q. Library sort was first published in___________.

View solution

Q. Sorting makes handling of ______ in a file easier.

View solution

Q. What refers to a simple sorting algorithm?

View solution

Q. _________is efficient for data sets which are already substantially sorted. The time complexity is O(n + d), where d is the number of inversions.

View solution