Description
Principles of design, analysis and implementation of efficient algorithms. Case studies from a variety of areas illustrate divide and conquer methods, the greedy approach, branch and bound algorithms and dynamic programming.
Follow-On Courses
This course appears in the pre- or co-requisites for the following course(s):