CSE201: Analysis of Algorithms
Rigorous analysis of the time and space requirements of important algorithms, including worst case, average case, and amortized analysis. Techniques include order-notation, recurrence relations, information-theoretic lower bounds, adversary arguments. Analysis of the key data structures: trees, hash tables, balanced tree schemes, priority queues, Fibonacci and binomial heaps. Algorithmic paradigms such as divide and conquer, dynamic programming, union-find with path compression, augmenting paths. Selected advanced algorithms. Introduction to NP-completeness.5 credits
Year | Fall | Winter | Spring | Summer |
---|---|---|---|---|
2024-25 |
|
|||
2022-23 |
|
|
||
2023-24 |
|
|||
2021-22 |
|
|
||
2020-21 |
|
While the information on this web site is usually the most up to date, in the event of a discrepancy please contact your adviser to confirm which information is correct.