CMPS201: Analysis of Algorithms

Martine Schlag, Fall 2007

Homework 5: due Friday December 7 by 2pm in E2-219 (my office)
Homework 4: due Thursday November 29, beginning of class.
or by 2pm Friday 11/30 in E2-219 (slide it under the door)
Homework 3: due Thursday Nov. 8, beginning of class.
Homework 2: due Thursday Oct. 25, beginning of class.
Homework 1: due Thursday Oct. 11, beginning of class.

Instructor: Martine Schlag
e-mail: martine@soe (from off campus append ".ucsc.edu")
E2 219
(831)459-3243
Office Hours: Tuesday 10-11am and Wednesday 10-11am

TA: Greg Levin
e-mail: glevin@soe (from off campus append ".ucsc.edu")
Office Hours: Tuesday 2-4pm in Jack's Lounge in Baskin Engineering (first floor west end)

Text: Introduction to Algorithms by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein.
Second Edition
McGraw Hill, 2001. ISBN 0-07-013151-1
Bug reports

Pre-requisite
To take this course you must have completed an undergraduate course in data structures (such of CMPS101), an undergraduate course in algorithms (such as CMPS102) or an undergraduate course in graph theory (such as CMPE177). I will be checking pre-requisites Sept 27-Oct 9. If you are a Computer Engineering graduate student, please have the Data Structures section of your Base Requirement Worksheet signed off and show it to me. If you are a Computer Science graduate student you will need to show me a copy of your undergraduate transcript. You have until the October 9 class to show me you have the pre-requisite. After that class you will be dropped from the course.

The CMPS201 Web:
Copyright 2007; Department of Computer Engineering, University of California, Santa Cruz.

Portions of the CMPS201 Web may be reprinted or adapted for academic nonprofit purposes, providing the source is accurately quoted and duly credited.

Comments to: martine@cse.ucsc.edu (Last Update: 03/08/11 )