..:: String Matching on Data Structure and Algorithms related Questions and Answers

String Matching on Data Structure and Algorithms related Questions and Answers

Question : If the expected number of valid shifts is small and modulus is larger than the length of pattern what is the matching time of Rabin Karp Algorithm?
1. Theta(m)
2. Big-Oh(n+m)
3. Theta(n-m)
4. Big-Oh(n)
Answer : 2 - Big-Oh(n+m)

* Be the First to Post a Comment.

Submit comment :

Ask Question

Note : Name and Email never shown.

Other Questions

Practice Paper sets

String Matching on Data Structure and Algorithms related Questions and Answers

Submit comment :

Ask Question

JagSchool of Transformative Skills

PDPM Indian Institute of Information Technology Design Manufacturing

Global Institute Of Technology & Management

Institute for future education Entrepreneurship and leadership

Other Questions

Practice Paper sets

String Matching on Data Structure and Algorithms related Questions and Answers

Submit comment :

Ask Question

Subscribe