Searching Algorithms - Study Mode

Show All Answers

[#61] Is the space consumed by the linear search(recursive) and linear search(iterative) same?

(A) No, recursive algorithm consumes more space

(B) No, recursive algorithm consumes less space

(C) Yes

(D) Nothing can be said

Correct Answer

(A) No, recursive algorithm consumes more space

[#62] What will be the maximum number of comparisons that can be made in jump search algorithm (assuming k to be blocks jumped)?

(A) k

(B) n/k

(C) k-1

(D) k-1

Correct Answer

(C) k-1

[#63] Which of the following searching algorithm is fastest when the input array is sorted but has non uniformly distributed values?

(A) jump search

(B) linear search

(C) binary search

(D) interpolation search

Correct Answer

(C) binary search

[#64] Interpolation search has a better time complexity than exponential search for any given array.

(A) True

(B) False

Correct Answer

(B) False

[#65] What is the worst case time complexity of KMP algorithm for pattern searching (m = length of text, n = length of pattern)?

(A) O(n)

(B) O(n*m)

(C) O(m)

(D) O(log n)

Correct Answer

(C) O(m)