Boolean Algebra & Logic
Boolean identities, De Morgan's theorem, truth tables, canonical forms, and the symbolic groundwork for later circuit design.
The full DLD unit map, preserved as its own destination page so the course hub can stay clean and consistent.
From Boolean algebra to finite state machines, these are the core checkpoints for the course.
Boolean identities, De Morgan's theorem, truth tables, canonical forms, and the symbolic groundwork for later circuit design.
Gate families, equivalence, gate-level composition, and the translation between algebraic expressions and actual circuit structures.
Adders, subtractors, multiplexers, decoders, encoders, and the design habits behind reusable combinational modules.
Map-based minimization for SOP and POS forms, prime implicants, essential groups, and don't-care handling.
Latches, flip-flops, timing behavior, counters, and the shift from stateless logic into memory-driven systems.
Moore and Mealy models, state minimization, transition diagrams, and structured sequential design.