Design and Analysis of Algorithms

Catalog description

This course will cover advanced topics in data structures and algorithms beyond those studied in CST 200. Central to the course will be an understanding of the asymptotic worst-case performance of algorithms also known as big-O. Students will gain hands-on experience developing algorithms with performance trade-offs in mind, and learn to combine and compose multiple data structures to solve increasingly difficult problems. Topics in graph theory, optimization, dynamic programming, and NP- completeness will be addressed.