Worksheets

  1. Introduction: Stable Matching
  2. Reductions and the Stable Matching problem
  3. Asymptotic Analysis Review
  4. Playing with Graphs
  5. Clustering (part 1)
  6. Clustering (part 2)
  7. Divide and Conquer)
  8. Memoization and Dynamic Programming, Part 1
  9. Memoization and Dynamic Programming, Part 2
  10. DP in 2-D
  11. What's in a reduction?
  12. The Futility of Laying Pipe, Part I
  13. The Futility of Laying Pipe, Part II
  14. The Futility of Laying Pipe, Part III

Special, out-of-sequence, worksheets

  1. Pagerank
 

Emergency Procedures | Accessibility | Contact UBC | © Copyright The University of British Columbia