What: Exam 2

When:
  Oct 31, 2014 - take home test is out
  Nov 3, 2014 - due at the beginning of class

Topics:

  Dynamic Programming:
    Flight Problem
    Rod-Cutting Problem
    Subset Sum Problem
    Knapsack Problem
    Longest Common Subsequence Problem
    Longest Monotonically Increasing Subsequence Problem
    Matrix-chain Multiplication Problem

  Greedy Algorithms:
    Activity-scheduling Problem
    Chemical Storage Problem
    Huffman Coding Problem

Exam Format:
  Closed book, closed notes, no computers, no calculators.
  Can use a US-letter sized paper with your notes hand-written on it.
  (You may use both sides.)
  No computer-generated printout allowed.