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 Words

Term | Definition | Example Sentence |
---|---|---|

DeMorgan's Theorems | The complete of a sum (Or operations) equals the product (AND operations) of the complements. The complement of a product (AND) equals the sum (OR) of the complements. | The sum of the operations that result in a 1. Not A + B = C |

Distributive Property | Property that allows you to distribute an AND across several Or functions. | For example, (a + b)(c+d) is equal to ac+ad+bc+bd. |

Least Significant Bit (LSB) | The rightmost bit of a binary number. This bit has the number's smallest positional multiplier. | This Bit is the first number you divide when converting to binary and if the first number (to the zero power) when converting to decimal. |

Logic Circuit | Any circuit that behaves according to a set of logic rules. | The random number generator was a logic circuit. |

Logic Diagram | A diagram showing logic gates. | A map showing the different pathways a circuit can take. |

Minterm | A product term in a Boolean expression where all possible variables appear once is true or complement form. | Rows in a truth table that result in a 1 from zero's |

Most Significant Bit (MSB) | The leftmost bit of a binary number. This bit has the number's largest positional multiplier. | This bit is the last number you divide when converting to binary and if the last number (to the n power) when converting to decimal. |

Product-of-Sums (POS) | A type of Boolean expression where several sum terms are multiplied together. | Example is OR gates into an AND gate F = (A + C) (A + Not B)(Not B + C) |

Product Term | Boolean expression where one or more true or complement variables are AND'ed. | This is the function of an AND gate 1*0 = 0, 1*1 = 1. |

Sum-of-Products (SOP) | Boolean expression where several product terms are summed(OR'ed). | F= (NotB C) + ( A Not B) + AC |

Sum Term | Boolean expression where one or more true complement variable are OR'ed. | F = AC + B |

Truth Table | A list of all possible input values to a digital circuit, listed in ascending binary order, and an output response for each input. | A truth table counts in binary staring with 000. |

Maxterm | A sum term in a Boolean expression were all possible variable appear once in true or complement form. | Rows in a truth table that result in a zero form 1's |

Created by:
XXX_MJM_XXX