Vidyalelo
Data Structure · Q18

String Matching

Programming · Data Structure · question 18

Q18

How does the Rabin-Karp algorithm handle collisions in hashing?

A.
By using a rolling hash.
Answer
B.
By using a secondary hash function.
C.
By rehashing the entire pattern.
D.
By using a separate data structure.

Answer: Option A

Solution

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