EECS 477
Introduction to Algorithms
Fundamental techniques for designing efficient algorithms and basic mathematical methods for analyzing their performance. Paradigms for algorithm design: divide-and-conquer, greedy methods, graph search techniques, dynamic programming. Design of efficient data structures and analysis of the running time and space requirements of algorithms in the worst and average cases.
Prerequisites & course information
EECS 281; (C or better, No OP/F). (Prerequisites enforced at registration.) EECS 376 or a proof-based math course. (BS). May not be repeated for credit. F.
Sources
Catalogue variants
- Introduction to Algorithms · 4 · College of Engineering catalogue
- Introduction to Algorithms · Graduate credit