CISC 5835: Handouts

These are "six-up" versions of the slides that I'm using in class. Feel free to print these out.

• Chapter 0: Prologue
  • An interlude: Mathematical induction
• Chapter 1: Algorithms with numbers
• An interlude: loop invariants (Hoare axiomatics)
• Chapter 2: Divide-and-conquer algorithms (includes sorting and searching)
• Chapter 3: Decompositions of graphs
• Chapter 4: Paths in graphs
• Chapter 5: Greedy algorithms
• Chapter 6: Dynamic programming
• Chapter 7: Linear programming
• Chapter 8: NP-complete problems