Nov 25, 2020  
2017-2018 Graduate Catalog 
    
2017-2018 Graduate Catalog [ARCHIVED CATALOG]

Add to Portfolio (opens a new window)

CMSC 641 - Design and Analysis of Algorithms

[3]
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.
Prerequisite: Prerequisite: CMSC-441 or equivalent or consent of instructor.



Add to Portfolio (opens a new window)