Vidyalelo
Data Structure · Q11

String Matching

Programming · Data Structure · question 11

Q11

What is the key data structure used in the Knuth-Morris-Pratt (KMP) algorithm for pattern matching?

A.
Hash Table
B.
Suffix Tree
C.
Failure Function
D.
Partial Match Table
Answer

Answer: Option D

Solution

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