What: Final Exam

When: Thursday December 18, 10:30--12:30pm

Where: OHS 318

Topics:
  Depth-first search
  Algorithms on DAG's:
    Topological sort
    Longest path, shortest path, counting paths etc.
  Gabow's path-based dfs for strong components algorithm
  Breadth-first search
  Dijkstra's shortest path algorithm
  MST algorithms
    Prim
    Kruskal
  Binary search
  Master Theorem
  Integer Multiplication
  Strassen Matrix Multiplication
  Modulo-Exponentiation by repeated squaring
  Diffe-Hellman Key Exchange Protocol
  
Exam Format:
  Closed book, closed notes, no calculators, no computers, no mobile devices.
  Can bring in a 8 1/2"x11" sized paper with your hand-written notes on it.
  (You may use both sides.)
  No computer-generated printout allowed.