| CPS130 |
|
Fall 1999 |
|
Introduction to the Design and Analysis
of Algorithms |
[ Background |
Grading
|Animations
|
Schedule
|
Current
Lecture |
Homework
|
Notifications ]
Background
The course builds on the study of the analysis and implementation of data
structures and algorithms from CPS100. The goal is to introduce a number
of important algorithms that are interesting both from a practical and
theoretical point of view.
Some specific topics include: sorting, searching, dynamic structure
manipulation, pathfinding, fast multiplication, nondeterministic algorithms
and computationally hard problems. Not open to students who have taken
Computer Science 174.
Instructor
John H. Reif
-
Office: D223LSRC
-
Phone: 660-6568
-
Email: reif@cs.duke.edu
-
Office hours: Tues, Thurs: 12:30 - 1:30
Teaching Assistant
Guangwei Yuan
-
Office: D337
-
Phone: 660-4011
-
Email: yuangw@cs.duke.edu
-
Office hours: Tues, Thurs: 2:30 - 4:00
Undergraduate Teaching Assistants
Daniel Oh (dso@duke.edu)
Charles Lin (csl6@duke.edu)
Alexander Okleshen (ago@duke.edu)
Meeting Times and Location
TTh 10:55-12:10 in 228 Gray
Textbook
Introduction
to Algorithms by Cormen, Leiserson, and Rivest (MIT
Press, 1990). (bugs)
Prerequisites
CPS 100 or equivalent and four semesters of college mathematics.
Web site
http://www.cs.duke.edu/education/courses/cps130/fall99
Grading
Class grade will probably be based on:
-
written homework assignments (35%),
-
class interactions (15%),
-
two in-class exams (30%), and
-
a final exam (20%).
Comments and Suggestions
Send anonymous
e-mail to the instructor.
Animations
Here is a collection of the JAWAA
animations we've used in class. (Revised JAWAA documentation.)
Notifications 
There is a make-up lecture at 6pm on Wednesday, Dec 8th, at LSRC D243.
Last modified: Tue Sep 28 08:54:36 EDT 1999