View reviews for professors for this course View On Testudo

CMSC351

Algorithms

A systematic study of the complexity of some elementary algorithms related to sorting, graphs and trees, and combinatorics. Algorithms are analyzed using mathematical techniques to solve recurrences and summations.

4 reviews
Average rating: 4.75

8 reviews
Average rating: 3.50

4 reviews
Average rating: 3.25

37 reviews
Average rating: 3.03

3 reviews
Average rating: 3.00

50 reviews
Average rating: 2.22

1 review
Average rating: 2.00

0 reviews
Average rating: Not yet rated

Average GPA: 2.35 between 5,393 students

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