Discrete Mathematics Fundamentals
- 1.Why Discrete Math Matters for Programmers
- 2.Propositional Logic: Statements, Connectives & Truth Tables
- 3.Predicate Logic & Quantifiers
- 4.Sets & Set Operations
- 5.Relations: Properties, Equivalence Relations & Partial Orders
- 6.Functions: Injective, Surjective & Bijective
- 7.Proof Techniques: Direct, Contrapositive & Contradiction
- 8.Mathematical Induction
- 9.Combinatorics: Counting, Permutations & Combinations
- 10.Capstone — Applying Discrete Math to Real Programming Problems
Read as One Page
PDF Downloads
Exercise Solutions
dmath1-1_challenge1.txtdmath1-1_challenge2.txtdmath1-1_challenge3.txtdmath1-2_challenge1.txtdmath1-2_challenge2.txtdmath1-2_challenge3.txtdmath1-3_challenge1.txtdmath1-3_challenge2.txtdmath1-3_challenge3.txtdmath1-4_challenge1.txtdmath1-4_challenge2.txtdmath1-4_challenge3.txtdmath1-5_challenge1.txtdmath1-5_challenge2.txtdmath1-5_challenge3.txtdmath1-6_challenge1.txtdmath1-6_challenge2.txtdmath1-6_challenge3.txtdmath1-7_challenge1.txtdmath1-7_challenge2.txtdmath1-7_challenge3.txtdmath1-8_challenge1.txtdmath1-8_challenge2.txtdmath1-8_challenge3.txtdmath1-9_challenge1.txtdmath1-9_challenge2.txtdmath1-9_challenge3.txtdmath1-10_challenge1.txtdmath1-10_challenge2.txtdmath1-10_challenge3.txt