
Already know some of this? A 2-minute test skips the lessons you know.
Take the placement testA free 19-lesson course built from 5 Minutes Engineering's 4h 36m of YouTube video. 3 days at 90 minutes a day, with study notes and a quiz in every lesson. A 2-minute placement test skips what you already know.
Taught by 5 Minutes Engineering on YouTube. Videos play in YouTube's own player, so the creator keeps every view.
Understand what constitutes a set, identify set types (singleton, null, finite, infinite), and calculate cardinality.
Define subsets and power sets, compute power set cardinality, and distinguish universal sets from disjoint sets.
Perform union, intersection, difference, and Cartesian product operations on sets and interpret results via Venn diagrams.
Define relations as subsets of Cartesian products and classify them as reflexive, symmetric, transitive, equivalence, or antisymmetric.
Identify posets, draw Hasse diagrams, find bounds, and determine when a poset forms a lattice.
Visualize set operations with Venn diagrams, handle multisets with multiplicity, and apply inclusion-exclusion for up to three sets.
Prove summation formulas using the three-step principle of mathematical induction.
Construct truth tables for negation, conjunction, disjunction, implication, and biconditional; derive converse, inverse, and contrapositive.
Construct truth tables for negation, conjunction, disjunction, implication, and biconditional; derive converse, inverse, and contrapositive.
Construct truth tables for negation, conjunction, disjunction, implication, and biconditional; derive converse, inverse, and contrapositive.
Construct truth tables for negation, conjunction, disjunction, implication, and biconditional; derive converse, inverse, and contrapositive.
Apply idempotent, commutative, associative, distributive, De Morgan, identity, domination, and absorption laws to simplify logical expressions.
Convert expressions to CNF/DNF, test argument validity via truth tables or implication chains, and use quantifiers.
Classify functions as injective, surjective, bijective; compute compositions; find inverses; and count possible functions between finite sets.
Distinguish combinations from permutations, apply sum and product rules, and solve arrangement problems with and without repetition.
Verify closure, associativity, identity, and inverse properties to classify algebraic structures up to rings and fields.
Define graph types (directed, weighted, complete, simple, multi, null), represent them via adjacency matrices/lists, and identify Euler/Hamiltonian paths.
Test graph isomorphism via invariants, find chromatic numbers, and construct MSTs using Prim's and Kruskal's algorithms.
Define tree terms (root, leaf, depth, height), classify binary trees (full, perfect, complete), and perform preorder, inorder, postorder traversals.