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

# Unit 2.1.1

Term | Definition | Examples |
---|---|---|

Distributive Property | Distribution property of multiplication over addition. The property that allows us to distribute ("multiply through"). | The distributive property allows me to distribute 2(3*9) to get (2*3)*(2*9). |

Least Significant Bit | The rightmost but of a binary number. This bit has the number's smallest positional number. | -The least significant digit in 110101 is [][][][][]1 |

Logic Circuit | Any circuit that behaves according to a set of logic rules. | Controlling systems may use logic circuits. (Alarms, etc.) |

Logic Diagram | A diagram, similar to a schematic, showing the connection of logic gates. | In the logic diagram, AND gates and OR gates were used. |

Maxterm | A sum term in Boolean expression where all possible variables appear once in true or complement form. | |

Minterm | A product term in a Boolean expression where all possible variables appear once in true or complement form. | There were three Minterms that appeared on the table. |

Most Significant Bit | The leftmost bit in a binary number. This bit has the number's largest positional multiplier. | The most signigicant bit in 110101 is 1[][][][][] |

Product-of-Sums (POS) | A type of Boolean expression where several sum terms are multiplied (AND'ed) together. | Multiplication used (instead of adding in the SOP, it multiplies). |

Product Term | A type of Boolean expression where one or more true or complement variables | The product of the terms. |

Sum-of-products | A type of Boolean expression where several product terms are summed (OR'ed) together. | The SOP of the circuit is AC+AB+ABC |

Sum Term | A term in a Boolean expression where one or more true or complement variables are OR'ed | Sum of the terms. |

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. | I got the SOP expression from the outputs on the truth table. |

DeMorgan's Theorems | 1). Theorem stating that the complement of a sum (OR operation) equals the product (AND operation) of the complements. 2). Theorem stating that the complement of a product (AND operation) equals the sum (OR operation) of the complements. | The sum of values equal it's product. |

Created by:
374256