Discrete Mathematics
Master formal proofs, combinatorics, graph theory, and discrete structures underpinning software and cryptography.
This intermediate course establishes the foundational discrete mathematical structures required for advanced computer science and systems engineering. Learners will analyze propositional and predicate logic, master combinatorial enumeration, evaluate algebraic properties, and implement graph and number-theoretic algorithms. The curriculum bridges rigorous mathematical proof techniques with direct industrial applications in cryptography, network routing, and software verification.
Curriculum
Two complete tracks. Study either or both — each has its own exam and certificate.
A rigorous theoretical foundation in discrete mathematics emphasizing formal proofs, predicate calculus, asymptotic enumeration, recurrence relations, and foundational graph theory.
Examine propositional syntax, first-order semantics, deductive systems, and formal proof strategies.
- Propositional Calculus and Natural Deduction Lab35 min
- First-Order Predicate Logic and Quantifier Semantics Lab40 min
- Mathematical Induction and the Well-Ordering Principle Lab45 min
Careers this prepares you for
- Cryptographic Engineer
- Algorithm Engineer
- Backend Systems Architect
- Formal Verification Specialist
- Compiler Engineer