CS 170 Section 109

Fall 1999

Announcements

• Important My (last) office hours are Mon (12/13) 3:30 - 5 PM, at 5th floor Soda.
• Minor correction to Note 13 -- for the Extended Euclidean Algorithm, section, it should read `smallest positive integer' instead of `smallest integer'.
• Brief solution to dynamic programming problems on the review hand out is here (ps).
• Handouts given during review session is here (ps).
• Some timing software for UNIX and Win32 are available here.
• Bug List in CLR

Section Notes

• Note 1 (ps) - Master Theorem, Asymptotic Notations (9/1/99)
• Note 2 (ps) - Depth First Search (9/8/99)
• Note 3 (ps) - Dijkstra's Algorithm (9/15/99)
• Note 4 (ps) - Minimum Spanning Trees, Review (9/22/99)
• Note 5 (ps) - Midterm Questions, Union-Find (9/29/99)
• Note 6 (ps) - Huffman Coding, Matrix Multiply (10/6/99)
• Note 7 (ps) - Fast Fourier Transform (10/13/99)
• Note 8 (ps) - Dynamic Programming (10/20/99)
• Note 9 (ps) - Linear Programming, Review (10/27/99)
• Note 10 (ps) - Linear Programming, Max Flow (11/03/99)
• Note 11 (ps) - NP Completeness (11/10/99)
• Note 12 (ps) - More NP Completeness (11/17/99)
• Note 13 (ps) - Even More NP Completeness, Number Theory (11/24/99)
• Note 14 (ps) - Number Theory, RSA Cryptosystem (12/1/99)

Other Notes

• Chris Harrelson's notes on Difference Equations.
• Notes by Alex Berg