String Matching - Study Mode
[#61] What is the time complexity of the Boyer-Moore string matching algorithm in the best case?
Correct Answer
(C) O(m/n)
[#62] Which string matching algorithm uses hashing to achieve its results?
Correct Answer
(B) Rabin-Karp
[#63] In which scenario does the Naive string matching algorithm perform well?
Correct Answer
(C) When both the pattern and text are very short.
[#64] What is the worst-case time complexity of the Rabin-Karp algorithm?
Correct Answer
(D) O(m*n)
[#65] What is the main advantage of the Boyer-Moore algorithm over others?
Correct Answer
(A) It skips sections of the text that cannot match.