CMSC351H
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.
Sister Courses: CMSC351
Past Semesters
6 reviews
Average rating: 5.00
0 reviews
Average rating: N/A
6 reviews
Average rating: 5.00
1 review
Average rating: 5.00
During the Spring 2020 and Spring 2021 semesters, students could choose to take some of their courses pass-fail mid-semester which skews grade data aggregated across multiple semesters.
Average GPA of 3.62 between 114 students*
* "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.