Other files
CSE202
Spring, 2015
These are the slides that were used in lectures.

  • Week 1, Stable matichings , Basics
  • Week 2, Union-find, more basics , Greedy algorithms, priority queues and heaps
  • Week 3, Minimum spanning trees, Divide-and-conquer
  • Week 4, Dynamic programming.
  • Week 5 - 6, Dynamic programming II, and III .
  • Week 7 - 8, Network flow, applications
  • Week 9 - 10, Approximation algorithms.

    Back to CSE202 page.