M

Mr. Dubey • 52.30K Points
Coach 

Q. Rabin Karp algorithm and naive pattern searching algorithm have the same worst case time complexity.

(A) true
(B) false
(C) ---
(D) ---
Correct : Option (A)

Explanation: 
 the worst case time complexity of rabin karp algorithm is o(m*n) but it has a linear average case time complexity. so rabin karp and naive pattern searching algorithm have the same worst case time complexity.

Share

Discusssion

Login to discuss.

Be the first to start discuss.

Related MCQs

Q. Empirical estimation models are typically based on

Q. To overcome the lag in the operating speeds of the I/O device and the processor we use ___________

Q. Determine the validity of the argument s1: If I stay up late at night , then I will be tired in the morning. S2: I stayed up last last night s: I am t

Q. A(n) can be used to preserve the integrity of a document or a message.

Q. Arrays are best data structures …………

Q. The astable multivibrator has

Q. Which of the following statements is true about stroboscope?

Q. In 10base2, 10base5, what do 2 and 5 stand for?

Q. Which of the following is not correct in relation to multi-destination routing?

Q. Which command is used to remove the read permission of the file 'note' from both the group and others?