# G22.1170.001 Spring 2003

• Lecture 1: Introduction to Algorithmics
Choose a Format: pdf   |   postscript
• Read Section 1 (General Intro)
• Read Section 7 (Asymptotic Notations), up to page 13 only.
• Use the Appendix for general reference.
• Lecture 2: Recurrences
Choose a Format: pdf   |   postscript
• Skim Section 1.
• Read Sections 2, 3, 4.
• Section 5: Know the arithmetic, geometric and harmonic series.
• Section 6: Standard form, polynomial-type and exponential-type sum.
• Section 9.2: Know the Master Theorem and how to apply it.
• Lecture 3: Balanced Search Trees
Choose a Format: pdf   |   postscript
• Skim Sections 1, 2, 3. Be familiar with the definitions of Dictionary and Priority Queues (p. 4).
• Read Sections 3: this section is essential, but it is mostly a review of basic Binary Search Trees (BST).
• Read Section 4: AVL Trees. In page 12, you see \mu(h). In our lecture on Monday, we used i instead of h, and wrote "s(Ti)" or "si" instead of \mu(i).
• Lecture 4: Pure Graph Algorithms
ERRATA
Choose a Format: pdf   |   postscript
• Lecture 5: Greedy Method
Choose a Format: pdf   |   postscript
• Read Sections 1,2,5. NOTE: At the beginning of Section 5, there is some reference to the matroid material in Section 4. Just ignore these.
• Lecture 6: Amortization Method
Choose a Format: pdf   |   postscript
• Read Sections 1-4 and 9. For Section 9, you just need to know the amortized complexity bounds when Fibonacci heaps are used to implement "mergeable queues" (Intro. to Section 5, p.16)
• Lecture 7: Dynamic Programming
Choose a Format: pdf   |   postscript