Discrete Mathematics
The planned outline of 14 modules. Lessons are written, run and reviewed before they are published.
Planned outline
- Module 1
Propositional logic
Coming soon - Module 2
Predicate logic and quantifiers
Coming soon - Module 3
Proof techniques
Coming soon - Module 4
Sets, functions and cardinality
Coming soon - Module 5
Relations
Coming soon - Module 6
Partial orders, lattices and Boolean algebra
Coming soon - Module 7
Counting and combinatorics
Coming soon - Module 8
Sums, recurrences and generating functions
Coming soon - Module 9
Number theory and cryptography
Coming soon - Module 10
Algebraic structures
Coming soon - Module 11
Graph theory
Coming soon - Module 12
Trees
Coming soon - Module 13
Discrete probability
Coming soon - Module 14
GATE practice
India-specific Coming soon
Related tools
Prime Factorization & Factors Calculator 360 = 2³ × 3² × 5 — with the factor tree, the ladder and every factor. LCM & HCF (GCD) Calculator HCF and LCM with the working shown three ways — prime factors, ladder and Euclid. Number Base Converter Binary, octal, decimal, hex and every base to 36 — exact, with the working shown.
Official documentation
- gate2027.iitm.ac.in/static/doc/GATE2027_Syllabus/CS_GATE2027_Syllabus.pdf (gate2027.iitm.ac.in)
- ocw.mit.edu/courses/6-042j-mathematics-for-computer-science-spring-2015 (ocw.mit.edu)
- docs.sympy.org/latest/index.html (docs.sympy.org)
More in Computer science fundamentals
- Object-Oriented Programming (coming soon)
- Database Management Systems (coming soon)
- Operating Systems (coming soon)
- Computer Networks (coming soon)
- All CS fundamentals tracks
- How we make lessons