Slides

• Stable Matching (Chapter 1)
• Basics of Algorithm Analysis (Chapter 2)
• Graphs (Chapter 3)
• Depth First Search
• Greedy Algorithms (Sections 4.1-4.4)
• Minimum Spanning Tree (Sections 4.5-4.7)
• Divide and Conquer Algorithms
  (Sections 5.1-5.5)
• Divide and Conquer Recurrences
• Convolutions and the Fast Fourier Transform
  (Section 5.6)
• Dynamic Programming
  (Sections 6.1-6.7)
• Bellman-Ford Shortest Paths
  (Sections 6.8-6.10)
• Maximum Flow
  (Sections 7.1-7.3)
• Max Flow Applications
  (Sections 7.5-7.12)
• Poly Time Reductions
  (Sections 8.1-8.2)
• NP-Completeness
  (Sections 8.3-8.4)
• Taxonomy of NP-Complete Problems
  (Sections 8.5-8.10)