Fundamental techniques for designing efficient computer algorithms, proving their correctness, and analyzing their complexity. General topics include graph algorithms, basic algorithm design paradigms (such as greedy algorithms, divide-and-conquer, and dynamic programming), network flows, NP-completeness, and other selected topics in algorithms.
23 terms
Other grades
University of Maryland
CMSC 451 at UMD: average GPA 3.02 across 3,233 students. Grade distribution by term. Fundamental techniques for designing efficient computer algorithms…
Average GPA: 3.02
Grade distribution records: 3,233 students across 23 terms.
| Grade | Students | Percent |
|---|---|---|
| A+ | 316 | 9.8% |
| A | 497 | 15.4% |
| A- | 264 | 8.2% |
| B+ | 261 | 8.1% |
| B | 511 | 15.8% |
| B- | 291 | 9.0% |
| C+ | 184 | 5.7% |
| C | 304 | 9.4% |
| C- | 142 | 4.4% |
| D+ | 4 | 0.1% |
| D | 73 | 2.3% |
| D- | 6 | 0.2% |
| F | 53 | 1.6% |
| W | 171 | 5.3% |
Based on 3,233 student grade records across 23 terms and 8 professors.
Related topic in CMSC
Related topic in CMSC
Related topic in CMSC
Related topic in CMSC
Related topic in CMSC
Related topic 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