CSCI 3680 Discrete Structures

This course offers an intensive introduction to discrete mathematics as it is used in computer science. Topics include functions, relations, sets, propositional and predicate logic, simple circuit logic, proof techniques, cryptography, discrete probability, graphs and trees, and understand basic Finite-State Machines, Turing Machines, and Formal Languages. This course is non-repeatable.

Credits Hours: 4

Prerequisite: C or better in MATH 1113 (or higher) and CSCI 1302.