Introduction to the Design and Analysis of Algorithms
[ Background |
Current Lecture ]
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.
Michael L. Littman
- Office: D209 LSRC
- Phone: 660-6537
- Email: firstname.lastname@example.org
- Office hours: 2:00pm - 3:00pm Wednesday, 2:00pm - 3:00pm Thursday,
30 minutes after each class, any time for quick questions,
other times by request (send email)
- Office: D112 LSRC
- Phone: 660-6544
- Email: email@example.com
- Office hours: 11:00am - 12:00pm MWF
TTh 10:55-12:10 in D106 (LSRC).
Introduction to Algorithms by Cormen, Leiserson, and Rivest (MIT Press, 1990). (bugs)
CPS 100 or equivalent and four semesters of college mathematics.
Class grade will be based on:
Here is a collection of the JAWAA animations
we've used in class. (Revised JAWAA documentation.)
- written homework assignments (30%),
- programming labs (10%),
- two in-class exams (40%), and
- a final exam (20%).
Last modified: Tue Sep 16 08:50:04 EDT 1997
by Michael Littman, firstname.lastname@example.org