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
2.1 Vocab Cards
| Term | Definition | Example Sentence |
|---|---|---|
| DeMorgan’s Theorems | 1. theorem stating that the complement of a sum (OR operation) equals the product (AND operation) of the compliments 2. Theorem stating that the complement of a product (AND operation) equals the sum (OR operation) of the complements | DEMORGANS THEOREM provides an easy way to find th inverse of a boolean expression |
| Distributive property | Full name: distributive property of multiplication over addition. the property that allows us to distribute (“multiplying through”) an AND across several OR functions. For example a(b+c)=ab+ac. | |
| least significant bit (LSB) | The rightmost bit of a binary number this that has the number smallest positional multipler | |
| 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 | we use a logic diagram to see the connection between the different gates |
| Max term | a sum term in a boolean expression where all possible variables appear once in true or complement form | |
| min term | a product term in a boolean expression where all possible variables appear once in true or complement form | |
| Most significant bit (MSB) | The leftmost bit in a binary number. the bit has the numbers largest positional multiplier | |
| Product-of-sum (POS) | a type of boolean expression where several sum terms are multiplied (AND’ed) together | |
| product term | a term in a boolean expression where one or more true or complement variables are OR’ed | |
| Sum-of-Products (SOP) | a types of boolean expression where several product terms are summed (OR’ed) together | |
| sum term | a term in a boolean expression where one or more true or complement variables are OR’ed | |
| truth table | A list of all possible input values to a digital circuit, listed in acsending binary order, and the output response for each input combination | |
| the important form of the DISTRIBUTIVE PROPERTY is M(A+B) = MA+MB | ||
| the table list bits ranges from the LEAST SIGNIFICANT BIT to the most significant bit | ||
| we use the logic circuit to do what we want | ||
| Maxterm expansion for f’ contains those MAX TERMS not present f (f’ = M1M2M3M4M5M6M7) | ||
| the MINTERM expansion for f’ contains those minterms not present in f (f’ = M0 + M1 + M2) | ||
| the table list bits ranges from least significant bit to MOST SIGNIFICANT BIT | ||
| we use the PRODUCT OF SUM to see what we need to multiple together | ||
| a seller of a toothbrush not only offers the physical PORDUCT TERM but also the idea of improving ones teeth | ||
| Ana use the SUM OF PRODUCTS to see what is being summed up | ||
| being able to see the SUM TERM of a product | ||
| Alex uses the TRUTH TABLE to see what LEDs are being turned on and off |
Created by:
ayejas
Popular Engineering sets