We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1
Unit-5 Important Topics
1. String Matching Alorithms
a. Naïve string matcher b. Rabin Karp Algorithm c. Knuth Morris Pratt (KMP) Additional a. String matching automata b. Boyer Moore Algorithm 2. NP Completeness (NPC) a. Introduction b. Problem Classes P, NP, NPC c. NPC and Reducibility d. Circuit Satisfiability Additional e. 3-CNF 3. Approximation Algorithm a. Introduction b. Vertex Cover c. Travelling salesman problem with triangle inequality Additional d. Set Cover
4. Short Notes on – (Optional)
a. Randomized algorithm b. Fast-Fourier transformation