Oct 19, 2018  
Undergraduate Record 2006-2007 
    
Undergraduate Record 2006-2007 [ARCHIVED RECORD]

CS 202 - Discrete Mathematics I


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.

Credits: 3