NEW 1.4.3 Boolean Algebra

Front

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

Back

Distribution

Front

Which of the following is a valid rule when working with Karnaugh maps? Options: 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

Back

Overlapping groups are allowed

Front

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

Back

1

Front

What is an XOR?

Back

Exclusive OR

Front

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

Back

(A Ʌ B) V (X Ʌ Y)

Front

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

Back

1

Front

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

Back

1

Front

When combining two half adder circuits together to make a full adder which additional gate is needed? Options: AND, XOR, NOT, OR

Back

OR

Front

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

Back

To implement logic using a minimum number of physical logic gates, reduce the cost of building physical circuits, and eliminate redundant parts of Boolean expressions.

Front

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

Back

O