CMPS 102
- Winter 2008
- Fall 2006
- Spring 2006
- Fall 2005
- Spring 2005
- Fall 2004
- Spring 2004
- Fall 2003
- Spring 2003
- Fall 2002
- Winter 2002
- Fall 2001
- Fall 2000
- Spring 2000
- Spring 1999
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. M. Warmuth, A. Van Gelder, S. Lodha, D. Helmbold, D. Achlioptas
(sourced from /cse/classes/cmps102/description.txt)