Home
Courses

Algorithms
Instructor: Manoj Gupta

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

Topic SubTopic Resource Coding
Greedy Interval Scheduling Problem Set 1 LeetCode
Candy Problem Set 2 LeetCode
Metro-I
Metro-II Problem Set 3 Leetcode
Disjoint Set Union Introduction
Path Compression Problem Set 4 LeetCode
Divide and Conquer Maximum Overlap Problem Set 5
Majority LeetCode
Median of Medians LeetCode
Closest Pair
Fast Fourier Transform FFT Part 1 LeetCode
FFT, Part 2
FFT, Part 3
FFT, Part 4
Applications of FFT Jeff Erickson FFT notes
Dynamic Programming Pingala Problem Set 6
Weighted Scheduling LeetCode
Edit Distance
Marathon Runner
Negative Weight Shortest Path
Flow Introduction Problem Set 7
Implementation
Proofs
Improving Running Time
Strongly Polynomial Time Algorithm
Flow Applications Bipartite Matching, Mobile Towers, Menger's Theorem Problem Set 8
Circulation and its applications
NP-Completeness P and NP Problem Set 9
NP Complete Problems

Assignment

Assignment Pdf
Assignment 1 pdf
Assignment 2 (Sent over google classroom)
Assignment 3 (Sent over google classroom)
Assignment 4 (Sent over google classroom)
Assignment 5 (Sent over google classroom)

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