CPS130
Fall 1997 Introduction to the Design and Analysis of Algorithms

[ Background | Grading | Resources | Animations | Schedule | Current Lecture ]

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

Michael L. Littman

Teaching Assistant

Hai Shao

Meeting Times

TTh 10:55-12:10 in D106 (LSRC).

Textbook

Introduction to Algorithms by Cormen, Leiserson, and Rivest (MIT Press, 1990). (bugs)

Prerequisites

CPS 100 or equivalent and four semesters of college mathematics.

Grading

Class grade will be based on:

Resources

Animations

Here is a collection of the JAWAA animations we've used in class. (Revised JAWAA documentation.)
Last modified: Tue Sep 16 08:50:04 EDT 1997 by Michael Littman, mlittman@cs.duke.edu