1.4.3 Boolean Algebra
No description yet. This curated deck is ready for daily study.
Card preview (11)
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?
XOR Only 1 single input can 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?
What is the circuit for the following expression? ( ¬ A ) V ( B Λ C )
What are the Boolean expressions for the following circuit?
S = (A XOR B) XOR Cin COUT = ((A XOR B) AND Cin) OR (A AND B)
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
Group of 8 = Evaluates to single expression (A) Group of 4 = Evaluates to two expressions (A Λ B) Group of 2 = Evaluates to three expressions (A Λ B Λ C) Group of 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) Group of 4 and two groups of 2. Remember! You must show the groupings on your Karnaugh map
