Dec 08, 2019  
Undergraduate Record 2018-2019 
    
Undergraduate Record 2018-2019 [ARCHIVED RECORD]

CS 2102 - Discrete Mathematics


Introduces discrete mathematics and proof techniques involving first order predicate logic and induction. Application areas include finite and infinite sets, elementary combinatorial problems, and graph theory. Development of tools and mechanisms for reasoning about discrete problems. Prerequisite: CS 1110, 1111, 1112 or 1120 with a grade of C- or higher.



Credits: 3