click below

click below

Normal Size Small Size show me how

# 2.1.1 Vocab

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

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 | a(b+c)=ab+ac |

Least Significant Bit | The rightmost bit of binary number. This bit has the number's smallest positional multiplier | In the least significant bit the number has to end with a 1 |

Logic Circuit | Any circuit that behaves according to a set of logic rules. | Half adders, full adders, multiplexers |

Logic Diagram | A diagram, similar to a schematic, showing the connection of logic gates. | An absrtact or non spatial diagram |

Maxterm | A sum term in a boolean expression where all possible variables appear once in true or complement form. | Where all outcomes end in zero |

Minterm | A product term in boolean expression where all possible variables appear once in true or compliment form. | Where all outcomes end in one |

Most Significant Bit | The leftmost bit in a binary number. This bit has the number's largest positional multiplier. | The largest value on the far left |

Product of Sums | A type of boolean expression where several sum terms are multiplied (AND'ed) together | A boolean expression consisting of Maxterms |

Product Term | A term in a boolean expression where one or more true or comlplement variables are AND'ed | A conjunction of literals |

Sum of Products | A type of boolean expression where several product terms are summed (OR'ed) together | AB+ABC+AC |

Sum Terms | A term in a boolean expression where one or more true or complement variables are OR'ed | A canonical expression |

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. | Four rows in the table raised to the power of 2 |

DeMorgan Theorems | Theorem stating that the complement of a sum(OR operation)equals the product (AND operration) of the complements, and theorem stating that the complement of a product (AND operation) equals the sum (OR operations )ff the components. | input: F1(X*Y)*(Y+Z) |