ECE358H1: Foundations of Computing

Fixed Credit Value
0.50
Hours
38.4L/25.6T
Description

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.

Prerequisite
Exclusion
Total AUs
51.20