CSI5610

Advanced Data Structures and Algorithms

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. CSI 5610 is cross-listed with APM 5610. Students may not receive credit for both courses. Formerly CSE 561. Prerequisite: Student must have graduate standing.

CSE561

School of Egr. and Comp. Sci.