Introduces discrete mathematics and proof techniques involving first order predicate logic and induction. Application areas include sets (finite and infinite), elementary combinatorial problems, and finite state automata. Development of tools and mechanisms for reasoning about discrete problems. Cross-listed as APMA 202. (S)
Prerequisites & Notes Prerequisite: CS 101 or 150 with a grade of C- or higher.