CMPS 101
- Spring 2008
- Fall 2007
- Winter 2007
- Fall 2006
- Summer 2006
- Spring 2006
- Winter 2006
- Fall 2005
- Summer 2005
- Spring 2005
- Winter 2005
- Fall 2004
- Summer 2004
- Spring 2004
- Winter 2004
- Fall 2003
- Fall 2003 #02
- Spring 2003
- Winter 2003
- Fall 2002
- Spring 2002
- Winter 2002
- Spring 2001
- Fall 2000
- Spring 2000
- Winter 2000
- Fall 1999
- Winter 1999
- Fall 1998
- Spring 1998
- Winter 1998
- Fall 1997
- Spring 1997
- Winter 1997
Studies basic algorithms and their relationships to common abstract data types. Covers the notions of abstract data types and the distinction between an abstract data type and an implementation of that data type. The complexity analysis of common algorithms using asymptotic (big "O") notation is emphasized. Topics include sorting and searching techniques, basic graph algorithms, and algorithm design techniques. Abstract data types covered include priority queues, dictionaries, disjoint sets, heaps, balanced trees, and hashing. Familiarity with C, Java, and Unix is assumed. Prerequisite(s): course 12B or 13H, Computer Engineering 16 or 16H, Mathematics 19B, and one course from the following: Mathematics 21, 22, 23A, 24, or Applied Mathematics and Statistics 27. Enrollment restricted to School of Engineering majors. P. Tantalo, A. Van Gelder
(sourced from /cse/classes/cmps101/description.txt)