CMPS102: Introduction to Analysis of Algorithms
*****COURSES ARE SUBJECT TO CHANGE*****
Methods for the systematic construction and mathematical analysis of algorithms. Order notation, the RAM model of computation, lower bounds, and recurrence relations are covered. The algorithm design techniques include divide-and-conquer, branch and bound, and dynamic programming. Applications to combinatorial, graph, string, and geometric algorithms. Prerequisite(s): course 101. D. Achlioptas, D. Helmbold, S. Lodha, A. Van Gelder, M. Warmuth
5 Credits
| Year | Fall | Winter | Spring | Summer |
|---|---|---|---|---|
| 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.