CS 170

Hi! Welcome to my discussion.

No. Date Topic
1 1/26/21 Asymptotic notation, divide and conquer
2 2/2/21 FFT
3 2/9/21 Graph algorithms
4 2/16/21 Greedy algorithms
4 2/16/21 Asymptotic notation, divide-and-conquer review
5 2/23/21 MSTs
6 3/1/21 Dynamic Programming
7 3/8/21 Linear Programming
8 3/15/21 No section (midterm!)
9 3/29/21 Network flow, Duality, Zero-Sum Games
10 4/6/21 Multiplicative weights, Reductions
11 4/13/21 Reductions, NP-Completeness
12 4/20/21 Randomized algorithms, Sketching, Streaming
13 4/27/21 Streaming, Hashing

Useful resources, by topic

13. Streaming, Hashing

Notes

Practice problems

12. Randomized algorithms, Sketching, Streaming

Notes

Practice problems

11. Reductions, NP-Completeness

Notes

Practice problems

10. Multiplicative weights, Reductions

Notes

Practice problems

9. Network flow, Duality, Zero-Sum Games

Notes

Practice problems

7. Linear programming

Notes

Practice problems

6. Dynamic Programming

Notes

Practice problems

5. MSTs

Notes

Practice problems

4. Greedy algorithms

Notes

Practice problems

3. DFS, Topological Sort, SCCs, Djikstra's

Notes

Practice problems

  1. Fall 2020, Problem 1
  2. Fall 2019, Problem 8
  3. Spring 2016, Problem 7 and problem 8

2. FFT

Notes

Practice problems

  1. Fall 2020, Problem 2
  2. Spring 2016, Problem 4
  3. Spring 2019, Problem 5

1. Asymptotic Notation, Divide-and-Conquer

Notes

Practice Problems

  1. Fall 2014, Midterm 1, Problem 2
  2. Spring 2019, Midterm 1, Problems 3/4