CS 38 Notes

This is the first edition of these notes. There are bound to be errors. If you find one please email me. Much appreciated.

View All Notes as a Single File. (Last updated: May 31, 2017)

Or view them section by section. Note: pagination does not match up.

1. Designing an Algorithm Last updated: Mar 29, 2017
2. Runtime Complexity and Asymptotic Analysis Last updated: Mar 29, 2017
3. Introductory Topics Last updated: Apr 9, 2017
4. Dynamic Programming Last updated: Apr 18, 2017
5. Greedy Algorithms Last updated: May 31, 2017
6. Graph Algorithms Last updated: Apr 21, 2017, Still in Draft
7. Branch and Bound Last updated: Apr 21, 2017
8. Divide and Conquer Last updated: May 15, 2017
9. Streaming Algorithms Last updated: Apr 22, 2017
10. Flow Algorithms Last updated: May 29, 2017
11. Linear Programming Last updated: May 29, 2017

Recitation Notes

Link to the CS 38 Home Page