CPS 230: The Design and Analysis of Algorithms

Fall 2000


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:

Wed and Fri 2:20-3:35 in D106 (class was previously announced to be Mon/Wed/Fri 2:20-3:10)
We will have classes a few Mondays 2:20-3:35 in order to make up for cancelled Wed/Fri classes.

Instructor:

Lars Arge

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

TA:

Lipyeow Lim

Office: D325 LSRC Bldg
Phone:  660-6586
E-mail: lipyeow@cs.duke.edu

Office Hours:

People:

Click here for a picture and the names of the students in the class.

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: Grades and statistics can be found here

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


Lars Arge
Last modified: Mon Nov 20 17:01 EDT 2000