adplus-dvertising
frame-decoration

Question

A technique for direct search is

a.

Binary Search

b.

Linear Search

c.

Tree Search

d.

Hashing

Answer: (d).Hashing

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. A technique for direct search is

Similar Questions

Discover Related MCQs

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

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

Q. In worst case Quick Sort has order

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

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

Q. The quick sort algorithm exploit _________ design technique.

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

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

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

Q. Quick sort is also known as

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

Q. The best average behaviour is shown by

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

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

Q. Which of the following sorting algorithm is stable ?

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

Q. The worst case of quick sort has order

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

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

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