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

A. O(n)

B. O(log log n)

C. O(n log n)

D. O(log n)

A. O(n)

B. O(2n)

C. O(n log n)

D. O(log n)

A. T(n-2)+c

B. 2T(n-1)+c

C. T(n-1)+c

D. T(n+1)+c

A. Brute force

B. Divide and Conquer

C. Greedy Technique

D. Backtracking

A. Exponential search

B. Linear search

C. Binary search

D. Jump search

A. array should be sorted

B. array should have not be sorted

C. array should have a less than 64 elements

D. array should be partially sorted

A. True

B. False

A. Exponential search is an in place algorithm

B. Exponential search has a greater time complexity than binary search

C. Exponential search performs better than binary search when the element being searched is present near the starting point of the array

D. Jump search has a greater time complexity than an exponential search

A. Used all the time

B. When the list has only a few elements

C. When performing a single search in an unordered list

D. When the list has only a few elements and When performing a single search in an unordered list

A. array should be sorted

B. array should have not be sorted

C. array should have a less than 128 elements

D. array should be partially sorted