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
FA5 Discrete
FA 5
| Question | Answer |
|---|---|
| We can use these “Laws of Boolean” to both reduce and simplify a complex Boolean expression in an attempt to increase the number of logic gates required. | False, reduce |
| The Distributive Property states that AV (B ∧ C) can be written as __?__. | (A V B) ∧ (A VC) |
| The Identity Law states that, A ∨ 0 can be written as __?__ | A |
| The Identity Law states that, A ∧1 can be written as __?__ | A |
| The Idempotent Law states that A ∧ A can be written as __?__. | A |
| What is the output for this logic gates? 1 OR 0 | 1 |
| The output of the given logic gates is 0. 1 OR 0 | False |
| What is the output for this logic gates? NOT 1 | 0 |
| What kind of gate does this Truth Table represent? NOT TABLE | NOT |
| This is the symbol used for AND logic gates. | False, OR TABLE |
| What gate is the notation '¬' representing? | NOT |
| What is the output for this logic gates? 0 AND 1 | True |
| What is the output for this logic gates? 0 AND 1 | 0 |
| This is a truth table that represents a NOT logical gate. | True |
| What is the output for this logic gates? 1 AND 1 | 1 |
| This Boolean Algebra Law states that A ∧ ¬ A=0 | Complement Law |
| This Boolean Algebra Law states that A ∧ (B ∨ C) = ( A ∧ B) ∨ ( A ∧ C) | Distributive |
| A + A =? | A, IDEMPOTENT |
| This Boolean Algebra Law states that A ∨ B =B ∨ A | Commutative |
| This Boolean Algebra Law states that ¬(A ∧ B)= ¬A ∨ ¬B | De Morgans |
| A + 1 =? A OR 1 | 1, ANNULMENT |
| This Boolean Algebra Law states that A ∨ 0 = A | Identity Law |
| A + A' =? A or notA COMPLIMENT | 1, COMPLEMENT OR NEGATION |
| A ∨ B ∨ C ∨ D ∨ 1 is also equal to? | 1 |
| A + A =? A OR A IDEMPOTENT | A |
| (NOT A) AND B = Q, If A=0 and B = 1, what does Q equal? | 1 |
| NOT(A OR B) = Q, if A=0 and B=0, what does Q equal? | 1 |
| (C AND D) OR (NOT(A OR B)) = Q, If A=1, B=1, C=0 and D=1, what does Q equal? | 0 |
| What is the output of a NOT gate if the inputs is 0? | 1 |
| What is the output of an AND gate if its inputs are 1 and 1? | 1 |
| What will the circuit's output be? NOT 0 OR NOT 1 | 1 |
| What gate is the notation '∨' representing? | OR |
| Boolean multiplication corresponds to the logical function of an AND gate. | True |
| The Complement law states that A ∧ ¬A can be written as 0. | True |
| Double Negation states that ¬(¬A)=? | A |
| The De Morgan's Law states that ¬(A V B) can be written as __?__. | ¬A ∧ ¬B |
| The Absorptive Property states that AV (A ∧ B) can be written as __?__. | A |
| Boolean multiplication corresponds to the logical function of an AND gate. 0*1 = ? | 0 |
| The complement law states that A ∧ ¬A can be written as __?__ | 0 |
| The Associative Property states that (A V B) V C can be written as __?__. | A (B V C) |
| The Commutative Property states that A V B can be written as __?__. | B V A |
| You can combine Logic Gates. | yes |
| What kind of gate does this Truth Table represent? AND TABLE 1 1 1 | AND |
| A NOT gate has... | One input and one output |
| What kind of gate does this Truth Table represent? OR TABLE | OR |
| The output for the give logic gates is 1. NOT LOGIC GATES | FALSE |
| This Boolean Algebra Law states that A ∧ A = A | Idempotent Law |
| This Boolean Algebra Law states that A ∨ ¬ A= 1 | Complement Law |
| A + 0=? A OR 0 | A |
| This Boolean Algebra Law states that (A ∨ B) ∨ C = A ∨ (B ∨ C) | Commutative Law |
| This Boolean Algebra Law states that A ∨ A = A | Idempotent |
| This Boolean Algebra Law states that A ∧ ¬ A= 0 | Complement |
| What is the output of an OR gate if the inputs are 1 and 0? | 1 |
| What is the output of an AND gate if the inputs are 1 and 0? | 0 |
| The output of a ________ gate is only 1 when both inputs are 1. | AND |
| What gate is the notation '∧' representing? | AND |
| Boolean addition corresponds to the logical function of an OR gate. 0 + 0 =? | 0 |
| The Associative Property states that (A ∧ B) ∧ C can be written as __?__. | A ∧ (B∧ C ) |
| The Annulment Law states that A ∧ 0 can be written as __?__. | 0 |
| The Absorptive Property states that A∧ (A VB) can be written as __?__. | A |
| Under this law, the input of A has no effect. | Annulment Law |
| (¬A ∧ B) ∨ 1 is equal to? | 1 |
| This Boolean Algebra Law states that A ∨ (B ∧ C) = ( A ∨ B) ∧ ( A ∨ C) | Distributive Law |
| This Boolean Algebra Law states that ¬(A ∨ B)= ¬A ∧ ¬B | De Morgans |
| What is the output of an AND gate if its inputs are 1 and 0? | 0 |
| Under this law, the output always matches the input Group of answer choices Double Negation Law Idempotent Law none of the above Identity Law | Identity |
| The Idempotent Law states that A ∨ A can be written as __?__ | A |
| A + A' =? | 1 |
Created by:
palpakan56