Definition of Discrete Structures

Discrete Mathematics is the study of mathematical data structures that are discrete rather than continuous, meaning they consist of distinct and separate values rather than forming a continuum (like in calculus, which involves continuous functions and real numbers.)

Since Discrete Mathematics deals with countable, finite, or logically distinct objects, it includes topics like set theory, logic, discrete functions, combinatorics, discrete probability, Boolean algebra, and graph theory.

While some of these topics may seem abstract, they actually form the foundation for computer logic, cryptography, and error detection methods, which you'll study in future CISC classes you take, such as CISC 3310 (Principles of Computer Architecture).

Because Discrete Mathematics underlies the principles of computing, it provides essential tools for algorithm design, data structures, and formal verification techniques. In other words, although programming itself involves writing code, the theoretical foundation provided by this course ensures that the programs you write are efficient (fast and/or light), correct, and adjustable.