CS31005 Algorithms II

CS31005 Algorithms II - Autumn 2026

Instructor: Abhranil Chatterjee and Palash Dey

Teaching Assistants: Jada Venkata Yaswanth, Devanshu Agrawal, Mundada Ayush, Parth Shashin Patil, and Maddula Udaykrishna Venkatasai Prakashgupta

Course overview:
This is a second level algorithms course. Tentative topics: amortized analysis, Fibonacci heap, network flow, matching, NP-completeness, approximation algorithms, randomized algorithms, and parameterized algorithms

Classes:
Venue: NC231 (for odd roll numbers) and NC232 (for even roll numbers)
Timings: Thursday 3-4:55, Friday 2-3:55 [slot V4].

Grading: Attendance: 10%, Class test: 30%, Mid-term: 30%, Final: 30%

Announcements:

First class will be on July 23, 2026.

Lectures:

Practice Problems:

References:

Thomas H Cormen, Charles E Lieserson, Ronald L Rivest and Clifford Stein, Introduction to Algorithms.
Jon Kleinberg and Éva Tardos, Algorithm Design, Pearson, 2005.
Jeff Erickson, Algorithms, 2019.
Vijay V Vazirani, Approximation Algorithms, Springer-Verlag, 2001.
Mark de Berg, Otfried Cheong, Marc van Kreveld, Mark Overmars, Computational Geometry, Springer, 2008.
Marek Cygan, Fedor V. Fomin, Łukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michał Pilipczuk, Saket Saurabh, Parameterized Algorithms. You can download from here.
Rajeev Motwani, Prabhakar Raghavan, Randomized Algorithms
Eli Upfal and Michael Mitzenmacher, Probability and Computing: Randomization and Probabilistic Techniques in Algorithms and Data Analysis