CS 220
Theoretical Foundations
Finite and discrete algebraic structures relating to computers; sets, functions, relations. Machine-oriented logic. Combinatorial problems and algorithms. Finite automata and formal language theory. ***Prerequisite: CS 210, MATH 221 and STAT 160 or STAT 200.*** *Note: Students will receive credit for either CS 310 or CS 220.*
Sources
- Course catalogue ↗2026-2027