CMSC 351

Algorithms

3credits
About this course

A systematic study of the complexity of some elementary algorithms related to sorting, graphs and trees, and combinatorics. Algorithms are analyzed using mathematical techniques to solve recurrences and summations.

All available terms

23 terms

Avg. GPA
2.70
Grades
13,197

Other grades

W4.8%
More course details

University of Maryland

CMSC 351 at UMD: average GPA 2.70 across 13,197 students. Grade distribution by term. A systematic study of the complexity of some elementary algorithms…

Average GPA: 2.70

Grade distribution records: 13,197 students across 23 terms.

Grade distribution

GradeStudentsPercent
A+3812.9%
A1,40710.7%
A-1,0297.8%
B+1,1999.1%
B1,89414.4%
B-1,2669.6%
C+1,1098.4%
C1,34910.2%
C-8646.5%
D+1641.2%
D7555.7%
D-640.5%
F2892.2%
W6384.8%

Based on 13,197 student grade records across 23 terms and 10 professors.

Instructors

Related courses

The course page is taking longer to load. This summary is still available.

We could not load the full course details. This summary is still available.

Still loading. This can take a moment on a slow connection.

Loading My Class Grades