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 2025
310 reviews
Average rating:
4.69
20 reviews
Average rating:
3.05
Fall 2024
310 reviews
Average rating:
4.69
20 reviews
Average rating:
3.05
Spring 2024
310 reviews
Average rating:
4.69
85 reviews
Average rating:
3.75
Past Semesters
66 reviews
Average rating:
2.50
14 reviews
Average rating:
1.79
2 reviews
Average rating:
5.00
2 reviews
Average rating:
3.00
17 reviews
Average rating:
2.59
40 reviews
Average rating:
4.83
85 reviews
Average rating:
3.75
4 reviews
Average rating:
3.25
15 reviews
Average rating:
3.67
16 reviews
Average rating:
3.88
32 reviews
Average rating:
3.69
37 reviews
Average rating:
3.95
40 reviews
Average rating:
4.83
14 reviews
Average rating:
1.79
310 reviews
Average rating:
4.69
85 reviews
Average rating:
3.75
40 reviews
Average rating:
4.83
310 reviews
Average rating:
4.69
32 reviews
Average rating:
3.69
14 reviews
Average rating:
1.79
310 reviews
Average rating:
4.69
85 reviews
Average rating:
3.75