CPS 230
Fall 2005

The Design and Analysis of Algorithms

Tuesday and Thursday, 1:15-2:30 pm, D243 LSRC

This course introduces a number of algorithms that are theoretically interesting and practically important. It also discusses design paradigms, such as randomization and dynamic programming, and analysis techniques, probabilistic analysis and amortization.

Instructor: Main Topics: Course material:

There will be handouts and lecture notes avaliable after class. The main text used in this course is

Recommended References