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

A. O(n)

B. O(log n)

C. O(n^1/2)

D. O(1)

A. O(nlogn), O(logn)

B. O(logn), O(nlogn)

C. O(n), O(1)

D. O(1), O(n)

A. O(nlogn)

B. O(logn)

C. O(n)

D. O(n²)

A. No, recursive algorithm consumes more space

B. No, recursive algorithm consumes less space

C. Yes

D. Nothing can be said

A. k

B. n/k

C. k-1

D. k-1

A. jump search

B. linear search

C. binary search

D. interpolation search

A. True

B. False

A. O(n)

B. O(n*m)

C. O(m)

D. O(log n)

A. O(n)

B. O(2ⁿ)

C. O(1)

D. O(log n)

A. true

B. false