Lecture: 3 hours
Discussion: 1 hour
Prerequisite: Course ECS 122A; Statistics 131A recommended
Grading: Letter; problem sets and projects (40%), midterm (25%), final (35%)
Techniques for designing efficient algorithms, analyzing their complexity and applying these algorithms to a broad range of application settings. Methods for recognizing and dealing with hard problems are studied.
Students learn advanced techniques for the design and analysis of algorithms. They learn to apply these to efficiently solve real problems, and to determine which problems are intractable.
Expanded Course Description:
T. Cormen, C. Leiserson, R. Rivest, An Introduction to Algorithms, McGraw Hill, 2001 (second edition)
Instructors: M. Franklin, D. Gusfield, C. Martel, P. Rogaway
Prepared by: C. Martel (October 2001)