Elect Engr & Computer Science - Adv Data Structures & Algothms

Catalog description

A second course in abstract data structures and algorithmic design making use of these structures. Emphasis will be on understanding the high-level theoretical intuitions and principles, as well as a concrete understanding of implementation and applications. Topics include advanced treatment of trees, heaps, disjoint set structures, network flow, greedy algorithms, divide and conquer, dynamic programming, and complexity theory. Prerequisite: Upper-level EECS eligibility, EECS 330 and either EECS 461 or MATH 526.