ECE358H1: Foundations of Computing

0.50
38.4L/25.6T

Fundamentals of algorithm design and computational complexity, including: analysis of algorithms, graph algorithms, greedy algorithms, divide-and-conquer, dynamic programming, network flow, approximation algorithms, the theory of NP-completeness, and various NP-complete problems.

47.2 (Fall), 51.2 (Winter), 98.4 (Full Year)