Discrete mathematics is a broad branch of mathematics concerned with discrete elements like sets and graphs. It forms a broad subset for many areas of modern mathematics (graph theory, combinatorics, probability theory), and is foundational to modern computer science, especially with data structures, algorithmic design, compilers, and cryptography.
Key concepts
- Logic and proofs
- Combinatorics
- Rule of sums, rule of products
- Combinations, permutations
- Binomial theorem
- Combinatorial argument
- Probability
- Discrete structures
- Algorithm
- Theoretical computer science
- Formal language
- Regular expression
- Finite state automata (DFAs, NFAs)
Resources
- Discrete Mathematics with Applications, Susanna Epp