CMSC451

Design and Analysis of Computer Algorithms

Reviews for this course Testudo

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 2024

Andrew Childs

30 reviews
Average rating: 4.60

Laxman Dhulipala

15 reviews
Average rating: 4.67

Clyde Kruskal

87 reviews
Average rating: 2.86

Spring 2024

Andrew Childs

30 reviews
Average rating: 4.60

Clyde Kruskal

87 reviews
Average rating: 2.86

Fall 2023

Clyde Kruskal

87 reviews
Average rating: 2.86

Laxman Dhulipala

15 reviews
Average rating: 4.67

Spring 2023

Andrew Childs

30 reviews
Average rating: 4.60

Past Semesters

Clyde Kruskal

87 reviews
Average rating: 2.86

David Mount

34 reviews
Average rating: 4.79

Jessica Chang

0 reviews
Average rating: N/A

David Malec

0 reviews
Average rating: N/A

Andrew Childs

30 reviews
Average rating: 4.60

Samir Khuller

3 reviews
Average rating: 4.00

Jonathan Katz

11 reviews
Average rating: 3.73

Aravind Srinivasan

13 reviews
Average rating: 3.69

Laxman Dhulipala

15 reviews
Average rating: 4.67

* "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.