Unit 2

2. Significant Bit (LSB) / The rightmost bit of a binary number. This bit has the number’s smallest positional multiplier.
4. Theorems / Theorem stating that the complement of a sum (OR operation) equals the product (AND operation) of the complements, and
8. Term / A term in a Boolean expression where one or more true or complement variables are AND’ed.
10. Diagram / A diagram, similar to a schematic, showing the connection of logic gates.
11. (SOP) / A type of Boolean expression where several product terms are summed (OR’ed) together.
13. / A product term in a Boolean expression where all possible variables appear once in true or complement form.

1. / A sum term in a Boolean expression where all possible variables appear once in true or complement form.
3. (POS) / A type of Boolean expression where several sum terms are multiplied (AND’ed) together.
5. Significant Bit (MSB) / The leftmost bit in a binary number. This bit has the number’s largest positional multiplier.
6. Term / A term in a Boolean expression where one or more true or complement variables are OR’ed.
7. Circuit / Any circuit that behaves according to a set of logic rules.
9. 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.
12. 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.