CMPS 101, Fall 2000


Fall 2000 CMPS101 Class Locker


Important:
news server is down Saturday Nov 18. Look in Class Locker above for ho16.txt , which has more information on java and programming Dijkstra's algorithm.
Lecture times:
MWF 3:30-4:40pm, Jack Baskin Engineering (formerly Applied Sciences) Room 152.

Instructor:
Prof. Allen Van Gelder (avg @ cse.ucsc.edu)
Phone: (831) 459-4611
Office: 235 Jack Baskin Engineering (formerly Applied Sciences)
Office Hours: 11:00-1:00pm Tuesday, plus drop-in or appt.

Teaching Assistant:
TBA (  @ cse.ucsc.edu)
Office (grad lab):
Phone (in lab): (831) 459-
Office Hours: Lab/Discussion Sections + by appt.

Computer Lab Times and Location:
TBA
TBA

Discussion Times and Location:
TBA
TBA

Pre-requisites:
Students must ``have credit for'' CMPS 12B, CE 16, Math 19B, and some Math course in the 20's series, most likely Math 27.
My definition of ``have credit for'' is that the School of Engineering has determined that the student can obtain a CS or CE or ISM degree without having to take any of these classes in Fall 2000 or later. That is, the student has ``met the requirement for purposes of the major'' in all of the pre-requisites. There are several ways that this determination might be made; see the undergraduate advising staff with any questions; I do not personally make this determination.
A student with a very good Math record might be approved (by me) to take 101 without having the 20's series Math course.
Graduate students do not need to meet the pre-requisites.
Students not seeking one of the above-mentioned degrees normally do not enroll in CMPS 101, but if you are in this category, you should speak to me about pre-requisites.

Registering for a grade:
I urge students to register for a grade, rather than P/NP. My reason is very practical.
A P ``looks like'' a C. But in my experience passing students do B work on average.
C does not mean ``average''; it means ``satisfactory''.

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

Students should already be familiar with most of Chs. 1-3.
Lectures will cover advanced topics in chs. 1-3 and most or all of chs. 4, 7, and 8.
Parts of chs. 5, 6, and 9 will be covered.

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, n-th printing
by Thomas Cormen, Charles Leiserson, and Ron Rivest (1990)

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

Several additional books will be on reserve in the Science Library.

Questions regarding about page content should be directed to
webmaster@cse.ucsc.edu
 Last modified Saturday, 18-Nov-2000 22:09:12 PST.

Back to the CE / CS Class Home Pages.
Back to the CE / CS Home Page.