Proceedings of the 26th Academic Council held on 18.5.

2012

CSE202ALGORITHMDESIGNANDANALYSIS

VersionNo. Course Data Structures and Algorithms Prerequisites Objectives 1. To provide the knowledge about the methods of advanced algorithms 2. To understand the advanced algorithms such as cryptographic algorithms, Geometric Algorithm and Parallel Algorithm ExpectedOutcome The students will be able to 1. Apply the algorithm design techniques to analyze, solve and evaluate computing problems. 2. Apply algorithmic principles in modelling and designing software systems UnitI NPCOMPLETENESS 9+3hours THE COMPLEXITY CLASSES P AND NP: Definition of the classes P and NP; NPcompleteness (Cooks theorem); Standard NP-complete problems; Reduction techniques. ADVANCEDALGORITHMICANALYSIS 9+3hours UnitII Amortized analysis; Dynamic programming Matrix Chain Multiplication; combinatorial optimization, Elements of greedy strategies, activity, Huffman code. UnitIII STRINGMATCHINGALGORITHMS 9+3hours Nave string matching algorithms, KMP algorithm, Rabin-Karp algorithm, suffix trees, Exact string matching algorithm using suffix trees. UnitIV GEOMETRICALGORITHMS 9+3hours Line segments: properties, intersections; convex hull finding algorithms. APPROXIMATIONALGORITHMS 9+3hours UnitV Limitations of approximation, basic techniques, Vertex-cover problem, traveling salesman problem, set-cover problem Text/ReferenceBooks 1. Thomas H. Cormen , Charles E. Leiserson , Ronald L. Rivest , Clifford Stein, Introduction to Algorithms, 3rd Edition, MIT Press, 2009 2. Ellis Horowitz, S. Sahni and S. Rajasekaran, Computer Algorithms, S. P. Publications, 2nd edition, 2007 ModeofEvaluation: Recommendedbythe BoardofStudieson DateofApprovalbythe AcademicCouncil Tests, Assignments, Seminars.

L T P C 3 1 0 4

134