Set Theory, Relations & Functions
Sets and their laws, partitions, relations, posets and Hasse diagrams, closures with Warshall's algorithm, and functions with their inverses.
21MAB302T · B.Tech 3rd Year · Fifth Semester
Interactive lecture notes for all five units, arranged to follow the course lesson plan. Pick a unit below to begin. Each unit opens on its own, with its topics in order.
Discrete mathematics studies objects that come in separate, countable pieces: sets, relations, logical statements, finite groups and graphs. Where calculus describes smooth change, discrete maths describes structure, counting and reasoning step by step.
Every digital system is discrete. Logic gates follow the laws of logic, error-correcting codes are built on groups and fields, networks and circuits are graphs, and algorithm analysis relies on counting and induction. These units are the mathematical language behind both electronics and computing.
Sets and their laws, partitions, relations, posets and Hasse diagrams, closures with Warshall's algorithm, and functions with their inverses.
Counting with permutations and combinations, inclusion–exclusion, the pigeonhole principle, divisibility, primes and factorisation.
Propositions and truth tables, laws of logic, rules of inference with direct and indirect proofs, and mathematical induction.
Groups, permutation groups, subgroups and homomorphisms, rings, integral domains and fields, then error-correcting codes.
Degrees and handshaking, isomorphism, Euler and Hamilton paths, graph matrices, digraphs, trees, Kruskal's algorithm and colouring.
Discrete Mathematics (21MAB302T) · Units 1–5 · Interactive Lecture Notes