CS 250 - Discrete Structures for Computer Science

4 credits
An introduction to discrete mathematics for computer science applications, with an emphasis on rigorous proof methods. Topics include logic, functions, sequences, sets, induction, recursion, combinatorics, and graph theory. Prerequisite(s): MTH 112Z with a C- or better (or appropriate SOU placement level).
Grade mode designated on a CRN basis each term. Students should consult current term schedule.