Course Details
Subject {L-T-P / C} : CS6102 : Algorithm and Computational Complexity { 3-0-0 / 3}
Subject Nature : Theory
Coordinator : Bibhudatta Sahoo
Syllabus
Module 1 : |
Algorithm and problem solving, Conventional algorithm design paradigms, Approximation Algorithms, Randomized Algorithms, Pattern matching algorithms, Lower bound Technique, Algebraic and number theoretic algorithms, Genetic Algorithms, Parallel Algorithms, Bioinformatics Algorithms
|
Course Objective
1 . |
Analyze the asymptotic performance of algorithms |
2 . |
Write rigorous correctness proofs for algorithms |
3 . |
Apply important algorithmic design paradigms and methods of analysis. |
4 . |
Synthesize efficient algorithms in common engineering design situations. |
Course Outcome
1 . |
Analyze worst-case running times of algorithms using asymptotic analysis.
|
Essential Reading
1 . |
J Kleinberg, E Tardos, Algorithm Design, Addison-Wesley |
2 . |
Ellis Horowitz, Sartaj Sahni and Sanguthevar Rajasekaran., Fundamentals of Computer Algorithms, University Press |
Supplementary Reading
1 . |
T. H. Cormen, C. E. Leiserson, R. L. Rivest and C. Stein, Introduction to Algorithms, MIT Press |
2 . |
M. T. Goodrich and R. Tommassia, Algorithm Design, Wiley |