Digital Logic 101

Binary, octal, hex, BCD, and Gray code — fluency with every base you'll meet.

Seven canonical gates, IEEE symbols, NAND/NOR universality, and the bubble convention.

Postulates, identities, DeMorgan's theorems, absorption, and step-by-step simplification of SOP expressions.

Canonical SOP and POS forms, minterms, maxterms, Σm / ΠM compact notation, and don't-care annotation.

Visual minimisation: Gray-coded 2/3/4/5-variable K-maps, prime-implicant grouping, edge wrap, and don't-cares.

Tabular two-level minimisation: ones-count grouping, the combine rule, prime implicants, the PI chart, essentials, and Petrick's method.

Multiplexers, decoders, encoders, and magnitude comparators — standard SOP blocks with IEC shorthand and the MUX-as-function-implementer trick.

Half and full adders, ripple-carry chains, and the 4-bit add/subtract datapath — overflow vs carry-out, the way an ALU sees them.

Static and dynamic hazards in combinational logic, K-map adjacency diagnosis, and the consensus theorem cover that eliminates static-1 glitches.