What: EXAM 1

When: October 9, 2009

Topics:
  Asymptotic growth of functions
  Worst-case asymptotic analysis of algorithms
  Naive algorithms for SSUM, TSP, Graph Isomorphism
  Insertion Sort and Inversions
  Representation of graphs: adjacency matrices, adjacency lists
  Basic graph algorithms on adjacency matrices and adjacency lists
  Depth-first search
  Algorithms on dags
    Topological sort
    Longest path

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.