CIS121 Spring 2008
Lectures
| Date | Description | Link (PDF) |
|---|---|---|
| 09/09/2009 | Lecture Notes 1: Introduction, GCD programs | 01.pdf |
| 09/11/2009 | Lecture Notes 2: Empirical vs Analytic | 02.pdf |
| 09/14/2009 | Lecture Notes 3: Intro to Asymptotic Analysis | 03.pdf | 09/16/2009 | Lecture Notes 3 again |
| 09/18/2009 | Lecture Notes 4: Algorithm Analysis | 04.pdf |
| 09/21/2009 | Lecture Notes 4 cont., big-Theta for polynomials, as well as logn is O(n). | |
| 09/23/2009 | Lecture Notes 5: Solving Recurrence Relations | 05.pdf |
| 09/25/2009 | Lecture Notes 6:Recurrence Relations II | 06.pdf |
| 09/28/2009 | GCD running time | 07.pdf |
| 10/05/2009 | Stacks | 08.df |
| 10/09/2009 | Queues | 09.pdf |
| 10/10/2009 | PriorityQueues | 10.pdf |
| 10/14/2009 | Heaps | 11.pdf |
| 10/16/2009 | Huffman Coding | 12.pdf |
| 10/21/2009 | Maps, Treemaps | 13.pdf |
| 10/23/2009 | AVL Trees | 14.pdf |
| 10/26/2009 | Hashing I | 15.pdf |
| 10/28/2009 | Hashing II | 16.pdf |
| 10/30/2009 | Dynamic Programming | 17.pdf |