Discrete Mathematics Study Guide

Propositional Logic

Master logical connectives, truth tables, logical equivalences, and De Morgan's laws for building rigorous mathematical arguments.

Predicate Logic and Quantifiers

Learn universal and existential quantifiers, nested quantifiers, and translation between English and formal logical statements.

Proof Techniques

Develop skills in direct proof, contrapositive, contradiction, cases, and mathematical induction for constructing valid proofs.

Set Theory

Understand set operations, power sets, Cartesian products, set identities, and prove set relationships using formal methods.

Functions and Sequences

Study injective, surjective, bijective functions, composition, inverses, and analyze arithmetic and geometric sequences.

Number Theory and Modular Arithmetic

Explore divisibility, primes, Euclidean algorithm, modular arithmetic, and RSA cryptography applications essential for computer science.

Counting and Combinatorics

Master permutations, combinations, binomial theorem, inclusion-exclusion, and pigeonhole principle for solving counting problems.

Recurrence Relations

Solve linear recurrences using characteristic equations, iteration, generating functions, and apply the Master theorem.

Relations and Their Properties

Analyze reflexive, symmetric, transitive properties, equivalence relations, partial orders, and construct Hasse diagrams.

Graph Theory Fundamentals

Study graph terminology, representations, connectivity, Euler and Hamilton paths, planarity, and graph coloring problems.

Trees and Their Applications

Examine spanning trees, minimum spanning tree algorithms, binary trees, traversals, and Huffman coding applications.

Boolean Algebra and Logic Circuits

Simplify Boolean functions using Karnaugh maps, design logic gates, and understand digital circuit foundations.