May 26, 2019  
Undergraduate Record 2008-2009 
Undergraduate Record 2008-2009 [ARCHIVED RECORD]

CS 202 - Discrete Mathematics I

Introduces discrete mathematics and proof techniques involving first order predicate logic and induction. Application areas include finite and infinite sets and elementary combinatorial problems. 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.

Credits: 3