-------------------- CMSC420 Final Exam Topics --------------------
1.  LISP (chapter 2 in Notes on Data Structures)
2.  Storage Allocation (chapter 3 in Notes on Data Structures)
3.  Hashing (chapter 6 in Notes on Data Structures)
4.  Hierarchical Point Data (slides labeled hp on class web site
    including basics of linear hashing but not spiral hashing).
    This means Point quadtree, MX quadtree, PR quadtree, K-d tree,
    grid file, and EXCELL 
5.  Range Trees and Priority Search Trees (chapter 7 in Notes on
    Data Structures)
6.  Winged-edge representation (slides labeled we on class web site and
    discussion in the Foundations book on pages 317-322).
7.  Graphs (Section 1.6 in Notes on Data Structures on pages 47-53
    where you can stop after the first two paragraphs of page 53).
8.  Line Representations such as the PM1, PM2, and PM3 quadtrees
    (Section 2.2.2.6 in the Foundations book - pages 365-369)
9.  MX-CIF quadtrees, loose quadtree, and partition fieldtree
    (Slide hp14 of Hierarchical Point Data Slides and slides on web
    page and also slides names "Loose Quadtree (Octree) Cover
    Fieldtree" and "Partition Fieldtree" at 
    http://www.cs.umd.edu/~hjs/slides/sorting-in-space-expanded.NATO.anim.pdf)