View reviews for professors for this course View On Testudo

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 2022

11 reviews
Average rating: 5.00

14 reviews
Average rating: 4.07

62 reviews
Average rating: 2.53

Fall 2021

6 reviews
Average rating: 3.67

32 reviews
Average rating: 2.84

11 reviews
Average rating: 1.55

Summer 2021

15 reviews
Average rating: 3.67

Past Semesters

2 reviews
Average rating: 5.00

4 reviews
Average rating: 4.75

36 reviews
Average rating: 4.03

4 reviews
Average rating: 3.25

2 reviews
Average rating: 3.00

Average GPA: 2.83 between 3,330 students

"W"s are considered to be 0.0 quality points. "Other" grades are not factored into the average GPA calculation.