CMPS201: Analysis of Algorithms
*****COURSES ARE SUBJECT TO CHANGE*****
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. Enrollment restricted to graduate students; undergraduate students may enroll in this course if they have completed either course 102 or Computer Engineering 177 and have the consent of the instructor.
5 Credits
| Year | Fall | Winter | Spring | Summer |
|---|---|---|---|---|
| 2018-19 |
|
| ||
| 2017-18 |
|
| ||
| 2016-17 |
|
| ||
| 2015-16 |
|
| ||
| 2014-15 |
|
| ||
| 2013-14 |
| |||
| 2012-13 |
| |||
| 2011-12 |
| |||
| 2010-11 |
| |||
| 2009-10 |
|
| ||
| 2008-09 |
|
| ||
| 2007-08 |
|
| ||
| 2006-07 |
|
| ||
| 2005-06 |
|
| ||
| 2004-05 |
|
|
| |
| 2003-04 |
|
| ||
| 2002-03 |
|
|
| |
| 2001-02 |
|
| ||
| 2000-01 |
|
| ||
| 1999-00 |
|
| ||
| 1998-99 |
|
|
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.