gratuitous image

Computer Science 201
Analysis of Algorithms
cmps201 (14567)
Important:
Do Not run lpr at school on a pdf file or on a ps.gz file. Use the ps file.

CE students must demonstrate that they have satisfied the data structures preparation requirement (e.g., CMPS 101) or they will be deleted from the class. This policy is established at the request of the CE Department.
You must have your ``data structures requirement'' signed off and bring a xeroxed copy of this paper to hand in at class. See your adviser or the graduate staff person, Carol Mullane, or Prof. Schlag if you don't know what this means.

All students will demonstrate their preparation by taking a review examination on CMPS 101 material. This take-home exam will be given out in the first class meeting (Sep. 22). It is due Tuesday Sep. 27, 2:00PM. It will be graded. It must be your own work--no consultation with anyone except the Instructor. Any clarifications will be posted on the class newsgroup.

No permission codes will be issued until after the review exam is graded. Attend class. Attendance will be taken in the first several classes.

Fall 2005 Class Handouts
Handouts and other files. The syllabus is ho01.ps or ho01.pdf


Fall 2005 Class Project
Shared files for 201 projects, if there are any projects.


Key Dates, A.Y. 2005-06.
Registrar web page.


SOE Class Search.
Simplified access to Registrar web page.


Lecture times:
TTh 2:00-3:45, Engr. II, Room 194.

Instructor:
Prof. Allen Van Gelder (avg @ cse.ucsc.edu)
Phone: (831) 459-4611 (Lab 459-4160)
Office: 355 Engineering II (Lab 386)
Office Hours: Tue., Thurs. 4-5, plus drop-in or appt.

Teaching Assistant:
Jonathan Panttaja (jpanttaj @ cse.ucsc.edu)
Office: 395 E2
Phone: 831-459-4864
Office Hours: (395 E2)
  • Tuesday: 10-2
  • Wednesday: 12-3 PM
  • And by Appointment.
Review and Help Sessions: xxx xxx PM at 386 Lab(E2) for Midterm

Primary Textbook:
Computer Algorithms, 3rd Edition
by Sara Baase and Allen Van Gelder

Students should already be familiar with most of Chs. 1-8.
Lectures will cover advanced topics in chs. 1-8 and parts of chs. 9, 10, and 13.
A few topics in chs. 11, 12, and 14 might be covered.
A few topics not in the text might be covered by handouts.

Please click here to see Supplements
or visit Prof. Baase's web site: http://www-rohan.sdsu.edu/faculty/baase
and use the Back button on your browser if you want to return to this page.

Other Texts (for reference, no assignments):
Introduction to Computer Algorithms, 2nd Ed.
by Cormen, Leiserson, Rivest, and Stein (2001)

Design and Analysis of Computer Algorithms
by Aho, Hopcroft, and Ullman (1979)

C: An Advanced Introduction, ANSI C Edition
by Narain Gehani

Questions regarding about page content should be directed to
webmaster@cse.ucsc.edu
 Last modified Tuesday, 01-Nov-2005 07:38:33 PST.