|
|
|
Jul 08, 2025
|
|
2009-2011 Graduate Catalog [ARCHIVED CATALOG]
|
CS 632 - Algorithm Design and Analysis
Prerequisite: CS 620 Study of the time and space complexity of algorithms and of efficient algorithm design. Topics include amortized analysis, advanced data structures, greedy algorithms, divide-and-conquer, dynamic programming, randomized algorithms, NP-Completeness.
3 credits
|
|
|