Course Description

27-349 The Analysis and Design of Computer Algorithms W(3-1)

The design and analysis of efficient computer algorithms: standard methodologies, asymptotic behaviour, optimality, lower bounds, implementation considerations, graph algorithms, matrix computations (e.g. Strassen's method), NP-completeness.

Prerequisites: 27-190, 27-242, 63-215.

Course Profile

1998-99 Undergraduate Calendar