Help
Options
Didn't know it?
click below
click below
Knew it?
click below
click below
Don't Know
Remaining cards (0)
Know
retry
shuffle
restart
0:00
Embed Code - If you would like this activity on your web page, copy the script below and paste it into your web page.
Normal Size Small Size show me how
Normal Size Small Size show me how
Lesson 2.1 Key Terms
| Term | Definition | Example |
|---|---|---|
| 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. | I used the distributive property to correctly multiply. |
| Least Significant Bit (LSB) | The rightmost bit of a binary number. This bit has the number's smallest positional multiplier. | In 10111, the least significant bit is the far right 1. |
| Logic Circuit | Any circuit that behaves according to a set of logic rules. | A 74LS02 is a logic gate that can be used in the circuit. |
| Logic Diagram | A diagram, similar to a schematic, showing the connection of logic gates. | We use the logic diagram to correctly place the wires for the circuit to work. |
| Maxterm | A sum term in a Boolean expression where all possible variables appear once in true or complement form. | The maxterm is when all variables are 1 |
| Minterm | A product term in a Boolean expression where all possible variables appear once in true or complement form. | The minterm is when all variables are 0 |
| Most Significant Bit (MSB) | (MSB) The leftmost bit in a binary number. This bit has the number's largest positional multiplier. | For example in the binary number 0111, the most significant bit is 0. |
| Product-of-Sums (POS) | A type of Boolean expression where several sum terms are multiplied (AND'ed) together. | 1*0=0 |
| Product Term | A term in a Boolean expression where one or more true or complement variables are AND'ed. | A 1 = 1 that is product term |
| Sum-of-Products (SOP) | A type of Boolean expression where several product terms are summed (OR'ed) together. | A whole circuit would hold a sum of products. |
| Sum Term | A term in a Boolean expression where one or more true or complement variables are OR'ed. | A 1 would = a 0 and that would be the sum term |
| 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. | In a truth table with three variables there will be nine outputs |
| 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. | I used the DeMorgan theorem to make my circuit with AND and Or gates |
Created by:
EdwinJD
Popular Engineering sets