Searching Algorithms MCQ question and answer with solution | Data Structure MCQs

A. Linear Search

B. Binary Search

C. Hash Search

D. Interpolation Search

A. Works efficiently with small datasets.

B. Constant time complexity on average.

C. Requires less memory.

D. Works efficiently with small datasets.

A. O(n²)

B. O(n log n)

C. O(n)

D. O(log n)

A. O(n)

B. O(n log n)

C. O(n²)

D. O(log n)

A. Binary Search

B. Linear Search

C. Interpolation Search

D. Hash Search

A. O(n log n)

B. O(n)

C. O(log log n)

D. O(log n)

A. O(n)

B. O(n log n)

C. O(log n)

D. O(n²)

A. O(n)

B. O(1)

C. O(n log n)

D. O(n)

A. When using a linked list.

B. When searching a small array.

C. When the data is sorted and uniformly distributed.

D. When the array is unsorted.

A. Linear Search

B. Interpolation Search

C. Exponential Search

D. Binary Search