Lecture Schedule

  • Mar 28: Administrivia Slides

  • Mar 30: No lecture

  • Apr 1: Calibration Quiz in class

  • Apr 4: Started Greedy Algorithms. Slides

  • Apr 6: Kruskal's algorithm. Union and Find.

  • Apr 8: Union and Find Analysis. See Chapter 5.1 of this book

  • Apr 11: Contd.

  • Apr 13: Contd.

  • Apr 15: Contd.

  • Apr 18: Dynamic Programming. Slides

  • Apr 20: Contd.

  • Apr 22: Contd.

  • Apr 25: Contd.

  • Apr 27: Problem Session. Begin Max-Flow. Slides

  • Apr 29: Contd.

  • May 2: Contd.

  • May 4: Contd. Bipartite Matching Slides

  • May 6: Contd.

  • May 9: Problem Session.

  • May 11: Midterm.

  • May 13: No lecture.

  • May 16: Max Flow contd.

  • May 18: Contd.

  • May 20: Randomized Algorithm. Slides

  • May 23: Contd.

  • May 25: Contd.