Learning objectives
After this class, you should be able to:
- Given a pattern and a text,
show each step of the Knuth-Morris-Pratt algorithm for pattern matching.
- Give reasons to justify the
correctness of the Knuth-Morris-Pratt algorithm for pattern matching, and
derive its time complexity.
Reading assignment
- CLR: Section 32.4.
- Final Review
Exercises and review questions
- Questions on current
lecture's material
- CLR excercise 32.4-1.
- CLR excercise 32.4-5.
- Questions on next
lecture's material
- None.
Last modified: 4 Aug 2004