Read the unit, then let the drill mark you.

Sets

Roster and set-builder notation, subsets and power sets, union, intersection, difference and complement, Venn diagrams with inclusion–exclusion, sets as bit strings, and the Cartesian product.

Relations

A relation as a set of ordered pairs, its domain, range and matrix. Reflexive, symmetric, antisymmetric and transitive; equivalence classes and partitions; partial orders drawn as Hasse diagrams; composing relations.

Functions

Domain, codomain, image and range. Telling injective from surjective from bijective, inverting a bijection, composing f ∘ g, and the floor and ceiling functions.

Formal Logic

What counts as a proposition, the connectives ¬ ∧ ∨ → ↔, truth tables, tautologies and contradictions, converse, inverse and contrapositive, the equivalence laws, and checking an argument with the rules of inference.

Boolean Algebra and Logic Gates

AND, OR and NOT on 0 and 1, the laws of Boolean algebra and De Morgan's, reading the expression off a gate circuit, minterms and maxterms in SOP and POS, and simplifying an expression step by step.

Unit 1 · Module 1 · Pre-midterm

Sets

Unit 2 · Module 2 · Midterm

Relations

Unit 3 · Module 2 · Midterm

Functions

Unit 4 · Module 3 · Pre-final

Formal Logic

Unit 5 · Module 4 · Final

Boolean Algebra and Logic Gates