CS 1300 - Discrete Structures (4)

Logic, proof techniques, sets, basic counting rules, relations, functions and recursion. Modular arithmetic, prime numbers. Graphs and trees. Boolean algebra, computer logic, and combinational circuits.

Prerequisite(s): C or better in MAT105/MAT 1050 & MAT 106/MAT 1060; or MAT 1052 &MAT 106/MAT 1060; or MAT 112, MAT 114, MAT 115, MAT 116, MAT 214, MAT 215, MAT 216, MAT 1140, MAT 1150, or MAT 2140.
Component(s): Lecture
Grading Basis: Graded Only
Repeat for Credit: May be taken only once