Lecture: 3 hours
Discussion: 1 hour
Prerequisite: Course ECS 122A
Grading: Letter; projects (25%), homework (10%), midterm (25%), final (40%)
Catalog Description:
Theory and practice of hard problems, and problems with complex
algorithmic solutions. NP-completeness, approximation algorithms, randomized
algorithms, dynamic programming and branch and bound. Students do theoretical
analysis, implementation and practical evaluations. Examples from parallel,
string, graph, and geometric algorithms.
Expanded Course Description:
Textbook:
T. Cormen and C. Leiserson,Introduction to Algorithms,
McGraw-Hill, 1990.
Computer Usage
This class will use workstations as well as home machines. Part
of the class will involve extensive computer usage.
Laboratory Projects:
Students will complete two to three large evaluations of competing
algorithms or implementations.
Engineering Design Statement:
This course is heavily design oriented, exploiting both formal
algorithm design methods and practical implementation.
ABET Category Content:
Engineering Science: 1 unit
Engineering Design: 2 units
Goals:
Students will:
Student Outcomes:
Instructors: D. Gusfield, C. Martel, P. Rogaway
Prepared By: C. Martel (October 1996)
Overlap Statement:
This course does not duplicate any existing course.