10 min read
Glossary
Look up any term from this course. Each entry links back to the lesson that taught it.
| Term | Definition | Lesson |
|---|---|---|
| AND gate | Outputs 1 only when all inputs are 1. Expression A · B. | AND, OR and NOT Gates |
| Boolean algebra | A branch of mathematics that works with values that are either true (1) or false (0), using the operations AND, OR and NOT. | Introduction |
| Complement | The opposite value of a Boolean variable: the complement of A is NOT A, written Ā. | The Laws of Boolean Algebra |
| De Morgan's theorems | NOT (A AND B) equals (NOT A) OR (NOT B); and NOT (A OR B) equals (NOT A) AND (NOT B). | De Morgan's Theorems |
| Logic gate | An electronic circuit that takes one or more binary inputs and produces a single binary output according to a fixed logical rule. | Logic and Truth Tables |
| NAND gate | AND followed by NOT: outputs 0 only when all inputs are 1. | NAND, NOR and XOR Gates |
| NOR gate | OR followed by NOT: outputs 1 only when all inputs are 0. | NAND, NOR and XOR Gates |
| NOT gate (inverter) | One input; outputs the opposite value. Expression Ā. | AND, OR and NOT Gates |
| OR gate | Outputs 1 when at least one input is 1. Expression A + B. | AND, OR and NOT Gates |
| Sum of products (SOP) | A Boolean expression written as several AND terms joined by OR, made by taking each row of a truth table where the output is 1. | From a Real Problem to a Circuit |
| Threshold | The value at which a sensor input changes from 0 to 1, for example a water level below 20%. | From a Real Problem to a Circuit |
| Truth table | A table that lists every possible combination of input values for a logic circuit, and the output for each combination. | Logic and Truth Tables |
| Universal gate | A gate type (NAND or NOR) from which every other gate can be built. | NAND, NOR and XOR Gates |
| XOR gate | Exclusive OR: outputs 1 when the inputs are different. Expression A ⊕ B. | NAND, NOR and XOR Gates |
More lessons in Boolean Algebra and Logic Gates · Previous: Course Exam
