Discrete mathematics studies mathematical structures that are fundamentally discrete rather than continuous — such as integers, graphs, logical statements, sets, etc.
Propositional logic, predicates and quantifiers, logical equivalences, inference rules, proof techniques (direct, contradiction, induction), etc.
Definition of sets, set operations (union, intersection, difference, complement), functions, relations, equivalence relations, partitions, Cartesian products.
Basic counting principles, factorials, permutations, combinations, binomial coefficients, inclusion–exclusion principle, basic counting arguments.
Graphs (vertices, edges), simple graphs vs multigraphs, trees, connectivity, paths, Euler/Hamilton concepts, adjacency/matrix representations, basic graph algorithms.
Boolean variables, Boolean operations (AND, OR, NOT), Boolean functions, truth tables, simplification, logic gates, applications in computation.
🔢 Truth Table Generator (A, B, C)
Select a logical expression: