CMSC 641 - Design and Analysis of Algorithms

Credits: [3]

Description: A study of advanced topics and techniques in discrete algorithms. Assumes student has a solid preparation in undergraduate algorithms (including asymptotic notations, recurrences, divide-and-conquer, greedy algorithms, dynamic programming, and fundamental graph algorithms). Core topics include probabilistic and amortized analysis, network flow, NP-completeness, and parallel algorithms. Selected topics might include: linear programming, computational geometry, randomized algorithms, cryptographic algorithms, and approximation algorithms.
Course ID: 053013
Prerequisite: Prerequisite: CMSC-441 or equivalent or consent of instructor.
Components: Lecture
Grading Method: A-F, Pass/Fail, Audit