This Winter 2021 course has ended, and is now open to the public.

In the links below one can find relevant lecture notes. However, the assignment solutions are locked.

Please send comments to deeparnab@dartmouth.edu

Schedule

7 Jan (X)	Lecture 1 : Introduction
8 Jan (Fri)	Lecture 2: The Big-Oh Notation
11 Jan (Mon)	Lecture 3: Algorithms with Numbers
13 Jan (Wed)	Lecture 4: Divide and Conquer (I) : Merge Sort + Recurrences
14 Jan (X)	Lecture 4.5 : Finding the top k elements in an array
15 Jan (Fri)	Lecture 5: Divide and Conquer (II) : Counting Inversions
20 Jan (Wed)	Lecture 6: Divide and Conquer (III) : Polynomial Multiplication
21 Jan (X)	Lecture 7 : Divide and Conquer (IV) : Closest Pair of Points
22 Jan (Fri)	Lecture 8 : Dynamic Programming (I) : Smart Recursion
25 Jan (Mon)	Lecture 9 : Dynamic Programming (II) : Subset Sum
27 Jan (Wed)	Lecture 10 : Dynamic Programming (III) : Knapsack
29 Jan (Fri)	Lecture 11 : Dynamic Programming (IV) : Edit Distance
1 Feb (Mon)	Lecture 12 : Dynamic Programming (V) : Longest Increasing Subsequence
3 Feb (Wed)	Lecture 12.5 : Dynamic Programming (VI) : Conclusion
4 Feb (X)	No lecture, but Brush up on Graphs
5 Feb (Fri)	Lecture 13 : Intro to Graphs + DFS
8 Feb (Mon)	Lecture 14 : Properties of DFS
10 Feb (Wed)	Lecture 15 : Topological Sort
12 Feb (Fri)	Lecture 16 : Strongly Connected Components
15 Feb (Mon)	Lecture 17 : Shortest Paths : BFS
17 Feb (Wed)	Lecture 18 : Shortest Paths : BFS Proof
18 Feb (X)	Lecture 18.5 : Shortest Paths : Dijkstra
19 Feb (Fri)	Lecture 19 : Shortest Paths : Bellman-Ford
22 Feb (Mon)	Lecture 20 : Flows and Cuts
24 Feb (Wed)	Lecture 21 : Weak Duality between Flows and Cuts
25 Feb (X)	Lecture 22 : Residual Networks
26 Feb (Fri)	Lecture 23 : The Ford-Fulkerson Algorithm
1 Mar (Mon)	Lecture 24 : Applications of Flows and Cuts
3 Mar (Wed)	Lecture 25 : Applications of Flows and Cuts
5 Mar (Fri)	Lecture 26 : Minimum Spanning Trees
8 Mar (Mon)	Lecture 27 : Linear Programming
10 Mar (Wed)	Lecture 28 : Hardness