CSE 561 - Advanced Data Structures and Algorithms

(4 credits)

The course systematically studies advanced data structures and the design and analysis of algorithms. The main focuses are the techniques for designing algorithms using appropriate data structures, proving correctness, and analyzing the computational complexity of algorithms. Topics covered include: hash tables; data structures for combinatorial optimization; search trees; recurrence relations; divide and conquer; dynamic programming; greedy methods; advanced graph algorithms; linear programming. This course will be supplemented by algorithms selected from recent technical literature.

Prerequisite(s): Student must have graduate standing.

Course updates made after the Graduate Catalog publication date will be posted in the Addendum to the Graduate Catalog.