CSC201

An introduction to discrete mathematics. Students study structures and concepts useful to computer science from the following areas: set theory, strings and formal languages, propositional and predicate calculus, relations and functions, and basic number theory. Additional topics include: interplay of inductive definition, inductive proof, combinatorics, recursive algorithms, search on graphs and trees, finite-state machines, regular languages, nondeterministic finite automata, and Kleene's Theorem. NOTE: Students may receive credit for CSC 201 or CIS 201 or MAT 206, but not for more than one. Prereq: MAT 201 and MAT 202 (or concurrent enrollment in MAT 202)

S - Every Spring

Prereq: MAT 201 and MAT 202 (or concurrent enrollment in MAT202)