AOI Combinational Logic Key Terms
Across
- 2. A list of all possible input values to a digital circuit, listed in ascending binary order, and the output response for each input combination.
- 4. The property that allows us to distribute (“multiply through”) an AND across several OR functions. For example, a(b+c)=ab+ac.
- 5. A type of Boolean expression where several sum terms are multiplied (AND’ed) together.
- 6. A term in a Boolean expression where one or more true or complement variables are OR’ed.
- 7. A product term in a Boolean expression where all possible variables appear once in true or complement form.
- 9. 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.
- 11. A diagram, similar to a schematic, showing the connection of logic gates.
- 13. Any circuit that behaves according to a set of logic rules.
Down
- 1. A term in a Boolean expression where one or more true or complement variables are AND’ed.
- 3. The rightmost bit of a binary number. This bit has the number’s smallest positional multiplier.
- 8. A type of Boolean expression where several product terms are summed (OR’ed) together.
- 10. A sum term in a Boolean expression where all possible variables appear once in true or complement form.
- 12. Significant Bit The leftmost bit in a binary number. This bit has the number’s largest positional multiplier.