CSCI 2110U – Discrete Mathematics for Computer Scientists

This is an elementary introduction to discrete mathematics. Topics covered include first-order logic, set theory, number theory, fundamental techniques of mathematical proof, relations, functions, induction and recursion, combinatorics, discrete probability, finite-state machines, and graph theory.
Formerly: Discrete Structures in Computer Science
Credit hours: 3
Lecture hours: 3
Tutorial hours: 1
Prerequisite(s): Students must have completed 24 credit hours in their area of specialization and be in clear standing.
Credit restriction(s): CSCI 1010U, ELEE 2110U, MATH 2080U
Cross-listed: MATH 2080U