CMSC420
Advanced Data Structures
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. 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.
Spring 2026
0 reviews
Average rating:
N/A
347 reviews
Average rating:
4.59
Fall 2025
15 reviews
Average rating:
1.73
347 reviews
Average rating:
4.59
Spring 2025
347 reviews
Average rating:
4.59
20 reviews
Average rating:
3.05
Past Semesters
66 reviews
Average rating:
2.50
15 reviews
Average rating:
1.73
2 reviews
Average rating:
5.00
2 reviews
Average rating:
3.00
20 reviews
Average rating:
2.35
41 reviews
Average rating:
4.83
96 reviews
Average rating:
3.56
4 reviews
Average rating:
3.25
15 reviews
Average rating:
3.67
17 reviews
Average rating:
3.88
32 reviews
Average rating:
3.69
37 reviews
Average rating:
3.95
41 reviews
Average rating:
4.83
15 reviews
Average rating:
1.73
347 reviews
Average rating:
4.59
96 reviews
Average rating:
3.56
41 reviews
Average rating:
4.83
347 reviews
Average rating:
4.59
32 reviews
Average rating:
3.69
15 reviews
Average rating:
1.73
347 reviews
Average rating:
4.59
96 reviews
Average rating:
3.56
347 reviews
Average rating:
4.59
96 reviews
Average rating:
3.56
347 reviews
Average rating:
4.59
20 reviews
Average rating:
3.05