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.

Spring 2023

16 reviews
Average rating: 4.75

Fall 2022

9 reviews
Average rating: 3.67

3 reviews
Average rating: 5.00

Spring 2022

16 reviews
Average rating: 4.75

Past Semesters

68 reviews
Average rating: 2.78

21 reviews
Average rating: 4.81

0 reviews
Average rating: N/A

0 reviews
Average rating: N/A

3 reviews
Average rating: 4.00

11 reviews
Average rating: 3.73

* "W"s are considered to be 0.0 quality points. "Other" grades are not factored into GPA calculation. Grade data not guaranteed to be correct.