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
Combo Logic Vocab
New vocabulary words
| Term | Definition |
|---|---|
| Associative Property | A mathematical function is associative if its operands can be grouped in any order without affecting the result. For example, addition is associative ((a+b) + c = a + (b+c)), but subtraction is not ((a-b) –c ≠ a-(b-c)). |
| Binary Number System | A number system used extensively in digital systems, based on the number 2. It uses two digits to write any number. |
| Boolean Algebra | Algebraic process used as a tool in the design and analysis of digital systems. In Boolean algebra only two values are possible, 0 and 1. |
| Boolean Expression | An algebraic expression made up of Boolean variables and operators, such as AND (–), OR (+), or NOT (-). Also referred to as Boolean function or a logic function. |
| Boolean Theorems | Rules that can be applied to Boolean algebra to simplify logic expressions. |
| Boolean Variable | A variable having only two possible values, such as HIGH/LOW, 1/0, On/Off, or True/False. |
| Combinational Logic | Digital circuitry in which an output is derived from the combination of inputs, independent of the order in which they are applied. |
| Commutative Property | A mathematical operation is commutative if it can be applied to its operands in any order without affecting the result. For example, addition is commutative (a+b=b+a), but subtraction is not (a-b≠b-a). |
| Decimal System | Number system that uses 10 different digits or symbols to represent a quantity. |
| DeMorgan’s Theorems | 1) Theorem stating that the complement of a sum (OR operation) equals the product (AND operation) of the complements, and 2) theorem stating that the complement of a product (AND operation) equals the sum (OR operation) of the complements |
| 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. |
| Least Significant Bit (LSB) | The rightmost bit of a binary num ber. This bit has the number’s smallest positional multiplier. |
| Logic Circuit | Any circuit that behaves according to a set of logic rules. |
| Maxterm | A product term in a 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. |
| Most Significant Bit (MSB) | The leftmost bit in a binary number. This bit has the number’s loargest positional multiplier. |
| Product-of-Sums (POS) | A type of Boolean expression where several sum terms are multiplied (ANDed) together. |
| Product Term | A term in a Boolean expression where one or more true or complement variables are ANDed. |
| Sum-of-Products (SOP) | A type of Boolean expression where several product terms are summed (ORed) together. |
| Sum Term | A term in a Boolean expression where one or more true or complement variables are ORed. |
| 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. |
Created by:
user-1992715