CS 2102

Discrete Mathematics

Course Description

Prerequisites

CS 1110, 1111, 1112, 1113, or 1120 with a grade of C- or higher; or the CS 1110 placement test

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.

Instructors

Current All Time

No instructors this semester

This course isn't being taught this semester. Click "All Time" to see previous instructors.