Digital Circuits & Logic Gates

NOT · AND · OR · NAND · NOR · XOR · Half Adder

1:00

How Boolean logic is wired into real electronics — from voltage levels and seven logic gates to the half adder that does binary arithmetic.

By the end, you can

Explain how voltage levels encode binary 0 and 1, and why a threshold prevents noise errors.
State the output rule for each of the seven gates (NOT, AND, OR, NAND, NOR, XOR, XNOR).
Predict the output of any single gate given its inputs, by applying the correct truth-table rule.
Explain why NAND (and NOR) are called universal gates and give an example construction.
Identify the one input combination where OR and XOR disagree, and explain the XOR-for-OR bug.
Trace a half adder for any two-bit input and produce the correct SUM and CARRY bits.
Distinguish a half adder (no carry-in) from a full adder (has carry-in) and explain why the distinction matters.

Up next in Binary & Data Representation