U
Advanced Data Structures
College of Computer, Mathematical, & Natural SciencesComputer Science
Description
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. Prerequisite:Minimum grade of C- inCMSC351andCMSC330; and permission of CMNS-Computer Science department. Or must be in the (Computer Science (Doctoral), Computer Science (Master's)) program.
Course outline
Checking availability…
Preview the 5 closest equivalencies already indexed in our system
CMSC 420 has possible credit equivalents including COMP250 at McGill University.