Unit 2.1 Key Terms

4. 1) Theorem stating that the complement of a sum (OR operation) equals the product (AND operation) of the complements, and2) Theorem stating that the complement of a product (AND operation) equals the sum (OR operation) of the complements.
6. The rightmost bit of a binary number. This bit has the number’s smallest positional multiplier.
7. A term in a Boolean expression where one or more true or complement variables are OR’ed.
8. A list of all possible input values to a digital circuit, listed in ascending binary order, and the output response for each input combination.
9. A term in a Boolean expression where one or more true or complement variables are AND’ed.
10. The leftmost bit in a binary number. This bit has the number’s largest positional multiplier.

1. A type of Boolean expression where several sum terms are multiplied (AND’ed) together.
2. A type of Boolean expression where several product terms are summed (OR’ed) together.
3. A diagram, similar to a schematic, showing the connection of logic gates.
4. 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.
5. A product term in a Boolean expression where all possible variables appear once in true or complement form.
6. Any circuit that behaves according to a set of logic rules.
10. A sum term in a Boolean expression where all possible variables appear once in true or complement form.