What: EXAM 1

When: October 3, 2013

Topics:
  asymptotics
  worst-case asymptotic analysis of
    - recursive algorithms
    - algorithms containing loops
  naive algorithm for SSUM 
  naive algorithm for TSP
  inversions in arrays
  heaps, priority queues
  binary trees
  binary search trees
  "balanced" binary search trees
    - red-black trees
    - splay trees
  sorting algorithms
    - insertion sort
    - selection sort
    - heap sort
    - tree sort
  augmented binary search trees
  order statistics
    - rank
    - select
  range searching
  counting dominating pairs

Exam Format:
  Closed book, closed notes, no computers, no mobile devices, 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.