CS 303 - Discrete Structures and Computing Theory 4 Credits
Description Mathematics content that is foundational to and useful for computer science. Topics include axioms and proofs, induction, graph theory, probability, finite automata, regular expressions, Turing machines, and the Church-Turing thesis.
Prerequisites A grade of C or better in CS 201.
Click here for the Fall 2025 Class Schedule
Click here for the Spring 2026 Class Schedule
Click here for the Summer 2026 Class Schedule
Add to Portfolio (opens a new window)
|