|
Sep 10, 2024
|
|
|
|
Undergraduate Record 2013-2014 [ARCHIVED RECORD]
|
CS 2102 - 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. Prerequisite: CS 1110, 1111, 1112 or 1120 with a grade of C- or higher.
Credits: 3
|
|