| |
May 01, 2026
|
|
|
|
|
CST 570 - Design and Analysis of Algorithms
This course provides an in-depth exploration of advanced data structures and algorithmic techniques, designed for graduate students who have a foundational understanding of data structures and algorithms. The course emphasizes both theoretical analysis and practical implementation of efficient solutions to complex problems. Topics include balanced trees, segment trees, amortized analysis, graph algorithms, network flows, dynamic programming, backtracking, complexity theory (P, NP, NP-completeness), and approximation algorithms. Students will engage in advanced topics and current research in the field.
Typically Offered: Fall term only
Units: 4
|
|
