1.4.3 Boolean Algebra Flashcards
Which logic gate is this truth table representing?
XOR
Only 1 single input can be true
Which logic gate is this truth table representing?
AND
Both inputs must be true
Which logic gate is this truth table representing?
OR
At least one input needs to be true
Which logic gate is this truth table representing?
NAND
The flip of the AND gate - both inputs must not be true
Which logic gate is this truth table representing?
NOR
The flip of an OR gate - both inputs need to be false
Which logic gate is this truth table representing?
NOT
Inverts the input
What would the logic circuit look like for this truth table?
Half-Adder
What is the circuit for the following expression?
( ¬ A ) V ( B Λ C )
What are the Boolean expressions for the following circuit?
Full Adder
How big would the expressions be for each of the following group sizes on a Karnaugh map?
- Group of 8
- Group of 4
- Group of 2
- Group of 1
8 = Evaluates to single expression (A)
4 = Evaluates to two expressions (A Λ B)
2 = Evaluates to three expressions (A Λ B Λ C)
1 = Evaluates to four expressions (A Λ B Λ C Λ D)
What would be the simplified expression for this Karnaugh map?
(NOT A and NOT D)
OR
(A AND B AND C)
OR
(NOT B AND NOT C AND NOT D)
What can an adder do that a half-adder cannot?
Half-adder only handles 2 inputs so cannot handle previous carries
What are the key facts about D-Type flip flops?
Data Input (D) can be at 1 or 0
Output (Q) can only change at a clocks rising edge (goes high)
When clock is high output(Q) changes to input (D)
Triggered by a clock pulse
What are the De Morgan’s Laws?
Each term is complemented, and then the ORs become ANDs, and
the ANDs become ORs
What is commutation?
It doesn’t matter which way around expressions go,
they mean the same thing both ways
X ^ Y = Y ^ X