-------------------- CMSC420 Final Exam Topics -------------------- 1. LISP (chapter 2 in Notes on Data Structures) 2. Storage Allocation (chapter 3 in Notes on Data Structures) & Garbage Collection slides (gc1 - gc7) 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 and key idea in spiral hashing). This means Point quadtree, MX quadtree, PR quadtree, K-d tree, grid file, and EXCELL 5. Line Representations such as the PM1, PM2, and PM3 quadtrees (Section 2.2.2.6 in the Foundations book - pages 365-369). See slides at pages 66-107 of the slide set called "Hierarchical Representations of Line Data" found at http://www.cs.umd.edu/class/fall2016/cmsc420-0301/lecnotes/cd.anim.pdf 6. 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) 7. Incremental nearest neighbor algorithm discussion (pp. 490-507 of the Foundations book)