CS 220 Design and Analysis of Algorithms
Introduces algorithm design strategies including divide-and-conquer, greedy methods, dynamic programming, and graph algorithms. Covers complexity analysis, NP-completeness, and performance trade-offs. Emphasis on mathematical rigor and implementation of efficient solutions. 3 credit hours.