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
Fall 2024
87 reviews
Average rating:
2.86
39 reviews
Average rating:
4.23
292 reviews
Average rating:
4.71
2 reviews
Average rating:
4.00
Spring 2024
292 reviews
Average rating:
4.71
196 reviews
Average rating:
2.82
Fall 2023
87 reviews
Average rating:
2.86
292 reviews
Average rating:
4.71
39 reviews
Average rating:
4.23
Summer 2023
39 reviews
Average rating:
4.23
Spring 2023
87 reviews
Average rating:
2.86
39 reviews
Average rating:
4.23
196 reviews
Average rating:
2.82
Past Semesters
3 reviews
Average rating:
3.00
17 reviews
Average rating:
2.59
87 reviews
Average rating:
2.86
4 reviews
Average rating:
3.25
4 reviews
Average rating:
3.50
91 reviews
Average rating:
2.34
0 reviews
Average rating:
N/A
120 reviews
Average rating:
3.62
292 reviews
Average rating:
4.71
3 reviews
Average rating:
5.00
39 reviews
Average rating:
4.23
292 reviews
Average rating:
4.71
196 reviews
Average rating:
2.82
292 reviews
Average rating:
4.71