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

A. O(√n)

B. O(log n)

C. O(n)

D. O(n log n)

A. Interpolation search requires a sorted array.

B. Binary search can handle unsorted arrays.

C. Interpolation search is always faster.

D. Binary search is based on divide-and-conquer, while interpolation search estimates positions.

A. Sorting arrays

B. Graph traversal

C. Implementing hash tables

D. Dynamic programming

A. Requires less space than arrays.

B. Fast average-case time complexity.

C. Works well with linked lists.

D. Requires less space than arrays.

A. Jump Search

B. Interpolation Search

C. Linear Search

D. Binary Search

A. Binary Search

B. Interpolation Search

C. Jump Search

D. Linear Search

A. It requires additional memory.

B. It is not efficient for small arrays.

C. It has higher time complexity.

D. It requires sorted data.

A. O(log n)

B. O(n)

C. O(n log n)

D. O(√n)

A. When data is uniformly distributed

B. When data is highly clustered.

C. When data is unsorted.

D. When data is sparse.

A. O(n log n)

B. O(1)

C. O(log n)

D. O(n)