CMPS 201
- Winter 2008
- Fall 2007
- Spring 2007
- Fall 2006
- Winter 2006
- Fall 2005
- Summer 2005
- Winter 2005
- Fall 2004
- Winter 2004
- Fall 2003
- Summer 2003
- Winter 2003
- Fall 2002
- Fall 2001
- Spring 2001
- Fall 2000
- Winter 2000
- Fall 1999
- Winter 1999
- Fall 1998
- Spring 1998
- Winter 1998
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. P. Tantalo, A. Van Gelder, D. Helmbold
(sourced from /cse/classes/cmps201/description.txt)