CS170 Notes

Update 4/13: Will try to post all notes before the final!

Notes feedback form: form

Note 0: Efficient Algorithms

Note 1: Divide and Conquer

Note 2: FFT and Polynomial Multiplication

Note 3 (95% finished): Introduction to Graphs and DFS for Graph Decomposition

Here’s also my discussion slides, though they’ll probably only be useful if you attended the discussion and are reviewing them.

I forgot to link attendance for discussion 3, so fill it out here if you went: form

Discussion 1 slides: Algorithms, divide and conquer

Discussion 2 slides: FFT

Discussion 3 slides: DFS

Discussion 4 slides: Midterm prep

Discussion 5: No Discussion

Discussion 6: DP

Discussion 7: LP

Discussion 8: Duality, Flow

Discussion 9: DP midterm 2 prep

Discussion 10: PNP and Reductions