| A | B |
|---|
| DeMorgan’s Theorems | 1) Theorem stating that the complement of a sum (OR operation) equals the product (AND operation) of the complements, and 2) Theorem stating that the complement of a product (AND operation) equals the sum (OR operation) of the complements. |
| Distributive Property | Full name: distributive property of multiplication over addition. The property that allows us to distribute (“multiply through”) an AND across several OR functions. For example, a(b+c)=ab+ac. |
| Least Significant Bit (LSB) | The rightmost bit of a binary num ber. This bit has the number’s smallest positional multiplier. |
| Logic Circuit | Any circuit that behaves according to a set of logic rules. |
| Logic Diagram | A diagram, similar to a schematic, showing the connection of logic gates. |
| Maxterm | A sum term in a Boolean expression where all possible variables appear once in true or complement form. |
| Minterm | A product term in a Boolean expression where all possible variables appear once in true or complement form. |
| MostnSignificant Bit (MSB) | The leftmost bit in a binary number. This bit has the number’s loargest positional multiplier. |
| Product-of-Sums (POS) | A type of Boolean expression where several sum terms are multiplied (ANDed) together. |
| Product Term | A term in a Boolean expression where one or more true or complement variables are ANDed. |
| Sum-of-Products (SOP) | A type of Boolean expression where several product terms are summed (ORed) together. |
| Sum Term | A term in a Boolean expression where one or more true or complement variables are ORed. |
| Truth Table | A list of all possible input values to a digital circuit, listed in ascending binary order, and the output response for each input combination. |
