EECS 281
Data Structures and Algorithms
Introduction to algorithm analysis and O-notation; Fundamental data structures including lists, stacks, queues, priority queues, hash tables, binary trees, search trees, balanced trees, and graphs; searching and sorting algorithms; recursive algorithms; basic graph algorithms; introduction to greedy algorithms and divide and conquer strategy. Several programming assignments.
Prerequisites & course information
(EECS 203 or MATH 465 or 565) and EECS 280; (C or better, No OP/F). (Prerequisites enforced at registration.) EECS 201 and minimum GPA of 2.5 over the best grade for each enforced prerequisite. (BS). May not be repeated for credit.
Sources
- Course catalogue ↗2026-2027
- Catalogue entry ↗
Catalogue variants
- Data Structures and Algorithms · 4 · College of Engineering catalogue