CSC 509 Algorithms

This is a course on design and analysis of algorithms. Examples from all major algorithm design techniques are studies, including exhaustive search, divide-and-conquer, dynamic programming, greedy algorithms, and backtracking. The mathematical analysis of algorithm complexity is emphasized throughout the course. Advanced data structures are also introduced. Prerequisite: CSC 302 or CSC 501 or admission to the Computer Science Master's degree program.

Credits

3