CS 2102 - Discrete Mathematics

Effective Start Date: 08/01/2021
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, 1113, or 1120 with a grade of C- or higher; or the CS 1110 placement test.

Requisites: Must have completed CS 1110 or CS 1111 or CS 1112 or CS 1113, or CS 1120 with a grade of C- or higher OR successfully completed the CS 1110 placement test

Credits: 3