Vidyalelo
Data Structure · Q34

String Matching

Programming · Data Structure · question 34

Q34

Which of the following string matching algorithms uses a "shift" table to skip unnecessary comparisons?

A.
Knuth-Morris-Pratt (KMP)
B.
Rabin-Karp
C.
Boyer-Moore
Answer
D.
Naive Search

Answer: Option C

Solution

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