This mathematical system is used to simplify logic expressions in digital circuits.
What is Boolean algebra?
These two theorems allow complements to be distributed across AND and OR operations.
What are DeMorgan’s Theorems?
A truth table shows circuit output responses for all possible input combinations.
What is true?
SOP stands for this logic expression format.
What is Sum‑of‑Products?
These are added to each gate output to help analyze a logic circuit.
What are test points?
In Boolean expressions, the dot (·) and plus (+) symbols represent these operations.
What are AND and OR?
According to DeMorgan’s Theorem #1, the complement of AB is equal to this.
What is A̅ + B̅?
A logic circuit with 3 inputs will have this many input combinations.
What is 8?
POS stands for this logic expression format.
What is Product‑of‑Sums?
One analysis method converts a circuit into this before writing a logic expression.
What is a truth table?
This Boolean operation inverts a variable, changing 0 to 1 and 1 to 0.
What is NOT (inversion)?
According to DeMorgan’s Theorem #2, the complement of A + B is equal to this.
What is A̅ B̅?
Truth table inputs are always listed in this order.
What is ascending binary order?
In SOP design, minterms are first implemented using this type of gate.
What is an AND gate?
This analysis method starts with a logic expression and ends with a truth table.
What is logic expression → truth table analysis?
This Boolean law states that X + Y = Y + X and X·Y = Y·X.
What is the Commutative Law?
This common DeMorgan shortcut is summarized as “break the line, __________ the sign.”
What is “change”?
A minterm corresponds to a truth table row where the output equals this value.
What is 1?
In POS design, maxterms are first implemented using this type of gate.
What is an OR gate?
Identifying whether a circuit works as intended is a key goal of this process.
What is logic circuit analysis?
This Boolean theorem allows the removal of a redundant term without changing the logic output.
What is the Consensus Theorem?
DeMorgan’s Theorems are often used to redraw poorly designed logic circuits into this simpler form.
What is an equivalent logic circuit?
Writing all minterms with output = 1 and OR’ing them together produces this expression type.
What is a Sum‑of‑Products (SOP) expression?
When only limited 2‑input and 3‑input gates are available, designers must do this to complete a circuit.
What is cascade gates?
Comparing expected and actual truth table outputs helps identify this problem.
What is a faulty logic circuit?