KMP Algorithm
Prerequisites of the Experiment
This experiment requires you to have basic knowledge about :
And above all, a curiosity to learn and explore!
Overview of the Experiment
- The aim of this experiment is to understand the intricacies of string searching and then delve further into the Knuth-Morris-Pratt Algorithm, its Time and Space Complexity, and how it compares against naive searching algorithm.
- The experiment features a series of modules with video lectures, interactive demonstrations, simulations, hands-on practice exercises and quizzes for self analysis.
Experiment Modules and their Weightage
| Module | Weightage | Expectation |
|---|---|---|
| Pre-Test | 10% | Solve All Questions |
| Naive String Searching | 25% | Understand basic algorithm of Naive String Searching |
| Preprocessing for LPS | 25% | Understand the Lowest-Prefix-Suffix array creation process |
| KMP Algorithm | 25% | Understand the Knuth-Morris-Pratt Algorithm |
| Post-test | 15% | Solve all Questions |