Design and Analysis of Algorithms-Course Outline

Course Description: The design and analysis of algorithms is the core subject matter of Computer
Science. Given a problem, we want to (a) nd an algorithm to solve the problem, (b) prove that the
algorithm solves the problem correctly, (c) prove that we cannot solve the problem any faster, and (d)
implement the algorithm. Designing an algorithm for a computational problem involves knowledge of the
problem domain, a thorough knowledge of the data structures that are available and suitable and no small
measure of creativity. This course concentrates on the above problems, studying useful algorithm design
techniques, and methods for analyzing algorithms.

Course Objectives: The objective of the course is to develop following skills in the students of computer
science:
getting to the mathematical core of problems,
improving mathematical and algorithmic writing,
enhancing programming skills,
identifying appropriate algorithms and data structures,
analysis of algorithms for time and space complexity,
understanding of algorithm design methodologies,
identi cation of di cult questions and nding strategies to cope with them.
Main References:
Thomas H. Cormen Charles E. Leiserson Ronald L. Rivest Cli ord Stein Introduction to Algorithms
Third Edition The MIT Press Cambridge, Massachusetts
Other References:
Robert Sidgewick, Kevin Wayne, Algorithms 4th ed.
Knuth, Donald Ervin, The Art Of Computer Programming (3 volumes) Addison-Wesley, 1977.