McqMate

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

A. | true |

B. | false |

Answer» A. true | |

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. |

2.9k

0

Do you find this helpful?

13

View all MCQs in

Design and Analysis of AlgorithmsNo comments yet

- Suppose the first fibonnaci number is 0 and the second is 1. What is the sixth fibonnaci number?
- If GCD of two number is 8 and LCM is 144, then what is the second number if first number is 72?
- What is the GCD of a and b?
- Is 9 and 28 coprime number?
- If gcd (a, b) is defined by the expression, d=a*p + b*q where d, p, q are positive integers and a, b is both not zero, then what is the expression called?
- Who gave the expression for the probability and expected value of gcd?
- What is the computational complexity of Binary GCD algorithm where a and b are integers?
- What is the LCM of 8 and 13?
- Is 9 and 28 coprime number.
- Which algorithm is the most efficient numerical algorithm to obtain lcm?