Algorithms

Outline Notes References Assignments

General information

Course code: CSS.201.1

Instructors: Kavitha Telikepalli & Piyush Srivastava

Schedule: Monday/Wednesday, 1400-1530, A-201, starting August 17

The following is a tentative list of topics for the class.

Lecture notes

The repository for the lecture notes for the course is here. It may not be accessible from outside the TIFR network.

Homeworks etc.

Homeworks are available here. (The link may not be accessible from outside the TIFR network.)

References

Relatively affordable Indian editions are available for most of the books below.

  1. Algorithm Design. Jon Kleinberg and Éva Tardos.
  2. Design and analysis of algorithms: A contemporary perspective. Amit Kumar and Sandeep Sen.
  3. Introduction to Algorithms. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein.
    • A fourth edition has just come out with additional material, but it may not yet be available as an Indian edition. The earlier editions are available in an Indian edition.
  4. The Design and Analysis of Computer Algorithms. Alfred V. Aho, John E. Hopcroft, and Jeffrey D. Ullman.
  5. Approximation Algorithms. Vijay V. Vazirani.