CMSC 420
Advanced Data Structures
Description, properties, and storage allocation functions of data structures including balanced binary trees, B-Trees, hash tables, skiplists, tries, KD-Trees and Quadtrees. Algorithms for manipulating structures. Applications from areas such as String Processing, Computer Graphics, Information Retrieval, Computer Networks, Computer Vision, and Operating Systems.
Prerequisites & course information
Prerequisite: Minimum grade of C- in CMSC351 and CMSC330 ; and permission of CMNS-Computer Science department. Or must be in the (Computer Science (Doctoral), Computer Science (Master's)) program.
Sources
- Course catalogue ↗2026-2027
- Catalogue entry ↗
Catalogue variants
- Advanced Data Structures · 3 Credits