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.
23 terms
Other grades
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 | Students | Percent |
|---|---|---|
| A+ | 381 | 2.9% |
| A | 1,407 | 10.7% |
| A- | 1,029 | 7.8% |
| B+ | 1,199 | 9.1% |
| B | 1,894 | 14.4% |
| B- | 1,266 | 9.6% |
| C+ | 1,109 | 8.4% |
| C | 1,349 | 10.2% |
| C- | 864 | 6.5% |
| D+ | 164 | 1.2% |
| D | 755 | 5.7% |
| D- | 64 | 0.5% |
| F | 289 | 2.2% |
| W | 638 | 4.8% |
Based on 13,197 student grade records across 23 terms and 10 professors.
Related topic in CMSC
Related topic in CMSC
Also in CMSC
Also in CMSC
Also in CMSC
Also in CMSC
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