CSC 431 Algorithms

This is a course on design and analysis of algorithms. Examples from all major algorithm design techniques are studied, including exhaustive search, divide-and-conquer, dynamic programming, greedy algorithms, and backtracking. The mathematical analysis of algorithmcomplexity is emphasized throughout the course. Advanced data structures are also introduced. Prerequisites: CSC 302 and MAT190.