CMSC 441 - Design and Analysis of Algorithms. (3)

This course studies fundamental algorithms, strategies for designing algorithms, and mathematical tools for analyzing algorithms. Fundamental algorithms studied in this course include algorithms for sorting and searching, hashing, and graph algorithms. Mathematical tools include asymptotic notations and methods for solving recurrences. Algorithm design strategies include the greedy method, divide-and-conquer, dynamic programming, and randomization.

Grading: Graded/Satisfactory Unsatisfactory/Audit
Course ID: 52940
Consent: No Special Consent Required
Components: Lecture
Prerequisite: CMSC 341, (MATH 142 or MATH 152) and (CMPE 320, STAT 355, or STAT 451) with a grade of ‘C’ or better.