LECTURE VIDEOS: Archive Youtube
The lecture videos currently have many typos. I will post errata here. If you find a mistake please shoot me an email
This set of notes is currently a work in progress.
| Subject | Notes | Video |
|---|---|---|
| Introduction and Divconquer | notes | L01A |
| The Master Theorem and MergeSort | notes | L01B |
| Arithmetic | notes | L02A |
| Quicksort and Quickselect | notes | L03A-B |
| DFS, Topsort, SCC | notes | L04A-B |
| BFS, Dijkstra | notes | L05A-B |
| Kruskals | notes | L06A |
| Bellman-Ford and Floyd-Warshall | notes | L08A-B |
| Kirchoff’s Tree Matrix Theorem | L08C | |
| Dynamic Programming | notes | L09A |
| Longest Subsequences | notes | L09B |
| Chain Matrix Multiplication | notes | L10A |
| Knapsack | notes | L10B |
| Tree DP | L10C | |
| NP-completeness | notes | L11A,L13C |
| Satisfiability | notes | L11B |
| Independent Set, Vertex Cover | notes | L12A |
| Subset Sum and Knapsack | notes | L12B |
| Graph Coloring | L13A | |
| Puzzles | L13B | |
| Max-Flow Min-Cut Theorem | notes | L14A-B |
| Linear Programming | notes | L15A |
| LP Duality | notes | L15B |
| Randomization | L16A | |
| Approximation | L17A |