View reviews for professors for this course View On Testudo

CMSC451

Design and Analysis of Computer Algorithms

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.

5 reviews
Average rating: 5.00

10 reviews
Average rating: 4.60

3 reviews
Average rating: 4.00

6 reviews
Average rating: 3.67

42 reviews
Average rating: 2.98

0 reviews
Average rating: Not yet rated

0 reviews
Average rating: Not yet rated

Average GPA: 2.74 between 1,399 students

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