CMSC 351
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.
Prerequisites & course information
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.
Sources
- Course catalogue ↗2026-2027