|
Computer Science 201
Analysis of Algorithms
cmps201 (13988)
|
ucsc.class.cmps201 #166
Date: Mon Sep 25 18:56:57 PDT 2006
From: Caitlin Sadowski
Subject: Axioms of Inequality
MIME-Version: 1.0
Content-Type: TEXT/PLAIN
X-Trace: darkstar 1159236453 128.114.48.62 (25 Sep 2006 19:07:33 -0700)
Lines: 2
The axioms of inequality are located on page 27 of the textbook.
ucsc.class.cmps201 #167
Subject: how are we required to present the answers
Organization: UC Santa Cruz CIS/CE
From: avg@cse.ucsc.edu (Allen Van Gelder)
Date: Mon Sep 25 19:26:19 PDT 2006
X-Trace: darkstar 1159237579 128.114.58.40 (25 Sep 2006 19:26:19 -0700)
Lines: 17
A student asks
"how are we required to present the answers for
the graph related problems. By my previous experiences (CMPS101) I am
used to showing the progress of the algorithms (i.e. Dijkstra, Prim,
etc) by using figures similar to those used on Cormen's text (page 568
of the second edition is an example). Is this sufficient as long as
enough annotations are included or do you require something more
specific?"
Those diagrams do not show any data structures. They would not be
full-credit answers, since the questions say "show the evolution of
the main data structures".
--Allen
- 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 Wed., Sep. 27, 12:30 PM.
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.
Unfortunately the class newsgroup has not been purged and I don't know
when they will do this.
If you start rn as described in ho01.{pdf,ps} (the syllabus handout)
and the article you see is quite old, try 1,164j to get rid of articles 1-164.
The subject for the first article for this quarter is "Fall 2006 welcome message".
It seems that most students do not use rn or trn for reading newsgroups,
so I am not giving detailed instructions here.
However, it is very important to disable threads, however you read
the newsgroup.
No permission codes will be issued until after the review exam is graded
(but enrollment is open until Sep 20).
Attend class. Attendance will be taken in the first several classes.
-
Fall 2006 Class Handouts
- Handouts and other files. The syllabus is ho01.ps or ho01.pdf
-
Fall 2006 Class Project
- Shared files for 201 projects, if there are any projects.
-
Key Dates, A.Y. 2006-07.
- Registrar web page.
-
SOE Class Search.
- Simplified access to Registrar web page.
- Lecture times:
- MWF 12:30-1:40, 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: Mon., Wed. 2:00-3:15, plus drop-in or appt.
- Teaching Assistant:
- Caitlin Sadowski (supertri <at> cse.ucsc.edu)
- Office E2-506, or E2-380 (mondays)
- Office Hours:
- Mon 2-3, E2-380
- Tues 11-12, E2-506
- Thurs 10:15-12, E2-506
- And by Appointment.
- 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
- 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