CPS 230: The Design and Analysis of Algorithms

Fall 1998


Description:

This is a graduate level algorithms class. Algorithm design techniques such as divide-and-conquer, dynamic programming, and greediness will be introduced, and algorithms for e.g. sorting, searching, and graph problems will be developed. Topics such as lower bound techniques and the notion of NP-completeness will also be covered.

Lectures:

Tuesdays and Thursdays 10.55-12.10 in D106

Instructor:

Lars Arge

Office: D228 LSRC Bldg
Phone: 660-6557
E-mail: large@cs.duke.edu

TA:

Laura Toma

Office: D224 LSRC Bldg
Phone: 660-6583
E-mail: laura@cs.duke.edu

Course material:

The course will be based on:

Other good reference books include:

Course Synopsis:

Summary of Lectures:

A summary of the lectures held so far, a list of the material covered, handouts, along with information about what is approximately going to happen in the next lectures, can be found here.

Grading:

Class grade will probably be based on:

Homework Assignments:

Homeworks will be assigned at the first class meeting of approximately every second week and are always due the second class of the following week. Collaboration is permitted (in fact, encouraged) but students must write up solutions on their own. LaTeX should be used for typesetting.

Newsgroup

Course Feedback

Links:


Lars Arge
Last modified: Mon Sep 7 21:34:18 1998