The course on algorithms is the next course after the Data Structures where will study some important algorithms and algorithmic techniques.

Assignments

  1. Hello world. This assignment is ungraded and is meant to familiarise yourselves with the programming judge. Please make sure that you try it out.

  2. Implementation of Minimum spanning tree algorithms. Deadline expired

  3. Max-flow and related problems. Due on November 3, 2014 (Monday) at mid-night

Some useful information.

Schedule 9:00-9:50 MWF
Venue RM 101 (New CSE building)
Office hours 16:00-17:00 hrs Monday
Course TAs Anshu Avinash , Abhimanyu Jaju , Jitendra Kumar Dhakar ,
Programming Judge TAs Pankaj Prateek , Harshvardhan Sharma

Books and reading material (will keep updating).

  1. Algorithms. Thomas H Cormen, Charles E. Leiserson, Ronald L. Rivest Prentice-Hall India.

  2. Modern Computer Algebra. Joachim von zur Gathen and Jürgen Gerhard. Cambridge University Press. For algorithms on algebraic stuff.

Blogs and other stuff

  1. Russel O’Connor in his blog post titled “A Very general method of computing shortest path” has given an actual implementation of the abstract version of the shortest path algorithm in Haskell. You can understand most of it even if you do not understand Haskell