NEW 1.4.3 Boolean Algebra

Which Boolean algebra rule/law can be exemplified by: A ∧ (BVC) ≡ (A∧B) V (A∧C)

• De Morgan’s Law
• Commutation
• Distribution
• Association

Which of the following is a valid rule when working with Karnaugh maps?

• Every binary '0' has to be included in a group
• Overlapping groups are not allowed
• Overlapping groups are allowed
• Every binary '1' doesn't have to included in a group

What is the output from the Boolean expression: ¬0?

• O
• 1
• 11
• 10

What is an XOR?

• Exclusive OR
• NOT OR
• AND
• Double negation

Using commutation, which is an equivalent expression for: (X Ʌ Y) V (A Ʌ B)

• (A Ʌ B) V (X Ʌ Y)
• (A V B) Ʌ (X V Y)
• (A V B) V (X V Y)
• (A Ʌ B) Ʌ (X Ʌ Y)

If A = 0, B = 1, C = 1. What is the output from: NOT A OR (B AND C)?

• 11
• O
• 10
• 1

If A = 1, B = 0, C = 1, D = 1. What is the output from the Boolean expression: (A∧B)V(C∧D)?

• 1
• O
• 10
• 11

When combining two half adder circuits together to make a full adder which additional gate is needed?

• AND
• XOR
• NOT
• OR

Why do we use Karnaugh maps, laws and rules to simplify Boolean expressions?

• So that the resulting logic can be implemented using a minimum number of physical logic gates
• To reduce the cost of building physical circuits
• In order to get rid of redundant parts of Boolean expressions
• All of these answers

If A = 1, B = 0, C = 0, D = 1. What is the output from the Boolean expression: (A∧B)V(C∧D)?

• 10
• 11
• 1
• O