CS 473 is an algorithms course aimed at advanced undergraduates and graduate students in computer science and related disciplines. I plan to keep notes and material related to this course in this repo for my use of understanding and mastering the material in this course.
| Recursion | Notes |
|---|---|
| Induction | |
| Solving recurrences | |
| Divide and conquer | |
| Whatever-first search | Lecture 1 |
| Depth-first search and topological sorting | Lecture 1 |
| Fast Fourier transforms | Notes |
|---|---|
| 1 | Lecture |
| Advanced dynamic programming | Notes |
|---|---|
| 1 | Lecture |
| Randomized algorithms | Notes |
|---|---|
| 2 | Lecture |
| Hashing, filtering, and streaming algorithms | Notes |
|---|---|
| 3 | Lecture |
| Maximum flows and minimum cuts | Notes |
|---|---|
| 4 | Lecture |
| Linear programming | Notes |
|---|---|
| 5 | Lecture |
| NP-hardness and related lower bounds | Notes |
|---|---|
| 6 | Lecture |
| Approximation algorithms | Notes |
|---|---|
| 7 | Lecture |