DE 2.1 Flashcards
Theorem stating that the complement of a sum (OR operation) equals the product (AND operation) of the complements, and
DeMorgan’s Theorems
Theorem stating that the complement of a product (AND operation) equals the sum (OR operation) of the complements.
DeMorgan’s Theorems
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.
Distributive Property
The rightmost bit of a binary number. This bit has the number?s smallest positional multiplier.
Least Significant Bit (LSB)
Any circuit that behaves according to a set of logic rules.
Logic Circuit
A diagram, similar to a schematic, showing the connection of logic gates.
Logic Diagram
A sum term in a Boolean expression where all possible variables appear once in true or complement form.
Maxterm
A product term in a Boolean expression where all possible variables appear once in true or complement form.
Minterm
The leftmost bit in a binary number. This bit has the number?s largest positional multiplier.
Most Significant Bit (MSB)
A type of Boolean expression where several sum terms are multiplied (AND’ed) together.
Product-of-Sums (POS)
A term in a Boolean expression where one or more true or complement variables are AND’ed.
Product Term
A type of Boolean expression where several product terms are summed (OR’ed) together.
Sum-of-Products (SOP)
A term in a Boolean expression where one or more true or complement variables are OR’ed.
Sum Term
A list of all possible input values to a digital circuit, listed in ascending binary order, and the output response for each input combination.
Truth Table
