Vidyalelo
Data Structure · Q12

String Matching

Programming · Data Structure · question 12

Q12

What does the Rabin-Karp algorithm use to avoid unnecessary comparisons?

A.
Rolling Hash
Answer
B.
Partial Match Table
C.
Failure Function
D.
Boyer-Moore Heuristic

Answer: Option A

Solution

Answer: Option A
No explanation is given for this question Let's Discuss on Board