[Duke Computer Science]

CPS130: Introduction to the Design and Analysis of Algorithms

Syllabus | Homeworks | Office Hours | Grades Statistics | Grade Lookup | Newsgroup | Feedback | Links

This course is an introductory undergraduate course on the design and analysis of algorithms building on the concepts from CPS100. It introduces a number of basic algorithms for for a variety of problems such as searching, sorting, selection and graph problems. It discusses analysis techniques, such as recurrences and amortization, as well as algorithm design paradigms such as divide-and-conquer, dynamic programming, and greedy algorithms.



Main Topics:

Course material:

Other good reference books include:



Homework assignments will be made available online as the semester progresses. No credit is given for homework problem solutions received late. For special situations contact Laura. Homework rules:

Last modified: Mon May 20 11:14:14 2002 by laura.