CMSC351

Algorithms

Prerequisite: Minimum grade of C- in CMSC250 and CMSC216. Restriction: Must be in a major within the CMNS-Computer Science department; or must be in Engineering: Computer program; or must be in the Computer Science Minor program; and Permission from the CMSC - Computer Science department. Credit only granted for: CMSC251 or CMSC351. Additional information: CMSC351 may not count as one of the required upper level CMSC courses for students who are required to have 24 upper level CMSC credits for graduation, i.e. for students who became computer science majors prior to Fall, 2002. 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: CMSC351H

Summer 2025

Justin Wyss-Gallifent

314 reviews
Average rating: 4.67

Spring 2024

Justin Wyss-Gallifent

314 reviews
Average rating: 4.67

Maksym Morawski

242 reviews
Average rating: 2.81

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

CMSC351

Algorithms

Fall 2025

Summer 2025

Spring 2025

Fall 2024

Spring 2024

Past Semesters