View reviews for professors for this course View On Testudo

CMSC451

Design and Analysis of Computer Algorithms

Prerequisite: Minimum grade of C- in CMSC351; and permission of CMNS-Computer Science department. Or must be in the (Computer Science (Doctoral), Computer Science (Master's)) program. 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.

Fall 2021

7 reviews
Average rating: 3.43

Spring 2021

57 reviews
Average rating: 2.91

Fall 2020

13 reviews
Average rating: 4.69

Past Semesters

11 reviews
Average rating: 5.00

3 reviews
Average rating: 4.00

6 reviews
Average rating: 3.67

0 reviews
Average rating: Not yet rated

0 reviews
Average rating: Not yet rated

Average GPA: 2.75 between 1,653 students

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