mca Syllabus

Design & Analysis of Algorithms
Code: PGCS102
Weekly Contact Hour: 3L
Credit: 3

Course Contents
Basic concepts: algorithms, data, list, stacks, queues and dequeues, sequential and linked allocation. Trees: computer representation and traversal of trees. Models of computation, bottom-up and top-down structured programming. Algorithm design methods: greedy algorithms, divide and conquer, dynamic programming. Analysis of algorithms, matrix multiplication, integer arithmetic, Approximation Algorithm and polynomial evaluation algorithms, introduction to NP complete problems.

Books
1. V. Aho , J. E. Hopcroft and J. D. Ullman, “The Design and Analysis of Algorithms”, Addison- Wesley, 1974.
2. T. H. Cormen , C. E. Leiserson and R. L. Rivest, “Introduction to Algorithms 2nd ed”, PHI.
3. Basu, “Design Methods and Analysis of Algorithms”, PHI
4. M. R. Garey and D. S. Johnson, “Computers and Intractability: A Guide to the Theory of NPCompleteness”, Freeman, 1979.
5. J. Van Leuween ed, Handbook of Theoretical Computer Science, Vol A., Elsevier, 1990.