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

String Matching on Data Structure and Algorithms related Questions and Answers

Question : What is the worst case running time of Rabin Karp Algorithm?
1. Theta(n)
2. Theta(n-m)
3. Theta((n-m+1)m)
4. Theta(nlogm)
Answer : 3 - Theta((n-m+1)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