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 2023

20 reviews
Average rating: 4.85

196 reviews
Average rating: 4.85

25 reviews
Average rating: 3.80

Fall 2022

20 reviews
Average rating: 4.85

12 reviews
Average rating: 1.50

196 reviews
Average rating: 4.85

52 reviews
Average rating: 3.50

Spring 2022

130 reviews
Average rating: 2.46

40 reviews
Average rating: 4.85

50 reviews
Average rating: 3.80

Past Semesters

24 reviews
Average rating: 1.50

2 reviews
Average rating: 5.00

2 reviews
Average rating: 3.00

74 reviews
Average rating: 3.95

4 reviews
Average rating: 4.75

104 reviews
Average rating: 3.50

4 reviews
Average rating: 3.25

20 reviews
Average rating: 4.85

15 reviews
Average rating: 3.67

18 reviews
Average rating: 3.67

37 reviews
Average rating: 3.95

* "W"s are considered to be 0.0 quality points. "Other" grades are not factored into GPA calculation. Grade data not guaranteed to be correct.