Design and Analysis of Algorithms

4 credits · College of Engineering catalogue

Advisory Prerequisite: EECS 281 or EECS 403. Enforced Prerequisite: EECS 376; No OP/F; or graduate standing . Minimum grade requirement of “B+” for enforced prerequisite. Credit Exclusions: Student may only receive credit for one course, EECS 477 or CSE 586 . (4 credits) Design of algorithms for nonnumeric problems involving sorting, searching, scheduling, graph theory and geometry. Design techniques such as approximation, branch-and-bound, divide-and-conquer, dynamic programming, greed and randomization applied to polynomial and NP-hard problems. Analysis of time and space utilization.