What: Final Exam

When: December 17, 2009, 3:30am-5:30pm

Where: OHS 318

Topics:
  Dynamic Programming:
    flight problem & assembly-line scheduling
    subset sum problem
    longest common subsequence
    matrix chain multiplication
  Divide and Comquer:
    binary search
    integer multiplication
    matrix multiplication
    merge sort

Reading:
  CLRS Ch 2.3, 4, 15.1, 15.2, 15.3, 15.4, 28.2, and all Handouts
  
Exam Format:
  Closed book, closed notes, no calculators.
  Can bring in a US-letter sized paper with your notes hand-written on it.
  (You may use both sides.)
  No computer-generated printout allowed.