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

A. O(logn)

B. O(n)

C. O(n²)

D. O(nlogn)

A. Both execute at same speed

B. Linear search(recursive) is faster

C. Linear search(Iterative) is faster

D. Cant be said

A. O(nlogn)

B. O(logn)

C. O(n)

D. O(n²)

A.

while (i < n && arr[i] <= x)  
        i = i*2; 

B.

while (i < n && arr[i] <= x)  
         i = i/2; 

C.

while (arr[i] <= x)  
        i = i/2; 

D.

while (i < n)  
        i = i*2; 

A. Binary search can't be used

B. Linear search can't be used

C. Both cannot be used

D. Both can be used

A. O(n + m)

B. O(m)

C. O(n)

D. O(m * n)

A. low = pos + 1, high remains unchanged

B. high = pos - 1, low remains unchanged

C. low = low +1, high = high - 1

D. low = pos +1, high = pos - 1

A. O(nlogn)

B. O(logn)

C. O(n)

D. O(1)

A. true

B. false

A. O(n)

B. O(m)

C. O(n + m)

D. O(m * n)