View reviews for professors for this course View On Testudo



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

Spring 2022

171 reviews
Average rating: 4.88

Fall 2021

36 reviews
Average rating: 3.17

66 reviews
Average rating: 2.80

Past Semesters

4 reviews
Average rating: 4.75

4 reviews
Average rating: 3.25

3 reviews
Average rating: 3.00

63 reviews
Average rating: 2.25

1 review
Average rating: 2.00

0 reviews
Average rating: Not yet rated

Average GPA: 2.33 between 7,068 students

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