CMSC 420, Section 0301 - Data Structures

Fall 2019

Resources

Lecture Slides

These lecture slides are a natural complement to the textbooks, and are provided here for your information. Each slide set has two versions: "Animated" and "Cumulative". The Animated slides contain multiple overlays per slide, which are traversed in sequence. This makes for more understandable viewing on your computer. The Cumulative slides contain only the slides after all layers have been added, which saves paper if you need to print the slides.

List Structures[anim][cum]
Trees[anim][cum]
Graphs[anim][cum]
Winged Edge Data Structure[anim][cum]
Triangulations[anim][cum]
Searching Techniques[anim][cum]
Dynamic Data Structures for Searching[pdf]
Multiway Searching[pdf]
Sorting Techniques[anim][cum]
Dynamic Storage Allocation[anim][cum]
Garbage Collection[anim][cum]
Memory Management[pdf]
Representation of Point Data[anim][cum]
Rectangle Data[anim][cum]
Range Trees[anim][cum]
Hashing Methods[anim][cum]
Nearest Neighbor[anim][cum]
Bulk Loading[anim][cum]
Quadtrees[anim][cum]
Surface Data[anim][cum]
3d Data[anim][cum]
Lisp[anim][cum]
Laths[pdf]
Hierarchical Representatons of Line Data[anim][cum]
Loose quadtrees[anim][cum]

All course materials are copyright © Hanan Samet 2019. All rights reserved. Students are permitted to use course materials for their own personal use only. Course materials may not be reproduced by any means (mechanical, electronic, or any other) and/or distributed without the express written permission of Hanan Samet.

Spatial Index Demo Applets

Link (Specific Browser and Java Settings Required.)


Web Accessibility