Assessment

• 70% :Exams

• 30% : Assignments

Syllabus

The tentative list of topics covered are as follows:

• Graph Algorithms

• Divide and Conquer

• Greedy

• Dynamic Programming

• Network Flow

• NP Completeness

• Approximation Algorithm

• Randomized Algorithm

Schedule

Assignment

Please read the IIT Gandhinagar Honor Code.

References

• Algorithm Design, Kleinberg and Tardos. 1st Ed, Pearson.

• Algorithms Notes, Jeff Erickson.

• Algorithms. Sanjoy Dasgupta, Christos Papadimitriou, Vijay Vazirani, McGraw Hill.

• The Design of Approximation Algorithms by David P. Williamson and David B. Shmoy