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

Spring 2024

Auguste Gezalyan

8 reviews
Average rating: 5.00

Fall 2023

Auguste Gezalyan

8 reviews
Average rating: 5.00

Emily Kaplitz

12 reviews
Average rating: 5.00

Past Semesters

Mohammad Hajiaghayi

17 reviews
Average rating: 2.59

Include P/F semesters

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