What: Final Exam

When: November 19, 2009, in class

Topics:
  Data Structure:
    binary heap
  Graph Algorithms:
    Strongly-connected components algorithm
    Bridge algorithm
    breadth-first search
    Dijkstra's algorithm
    Minimum Spanning Tree Algorithms: Prim, Kruskal
  Greedy Algorithms:
    Activity-scheduling
    Chemical Storage
    Interval Partitioning
    Huffman encoding

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.