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. (0/0/0/24/24) PREREQUISITES: ELEC 278, any discrete mathematics course
