Alsager - A2 - 1.4.3 - Boolean Algebra

What is the purpose of using Karnaugh maps in Boolean expressions?

• To define problems

• To manipulate Boolean expressions

• To create logic gate diagrams

• To understand the logic of D type flip flops

Which of the following is NOT a rule used to derive or simplify statements in Boolean algebra?

• De Morgan’s Laws

• Distribution

• Multiplication

• Double negation

What is associated with D type flip flops, half and full adders?

• Karnaugh maps

• Logic gate diagrams and truth tables

• Boolean logic

• The logic

What is the output of an AND gate (conjunction) when both inputs are True?

• True

• False

• Neither True nor False

• Both True and False

Which logic gate is represented by the symbol '∨'?

• AND

• OR

• NOT

• XOR

What does a truth table show?

• Only the true outputs for logic gates

• Only the false outputs for logic gates

• Every possible permutation of inputs to a logic gate and the corresponding output

• The logic gate designs

What is the output of an AND gate when both inputs A and B are 1?

• 0

• 1

• 2

• Undefined

In Boolean logic, the expression A ∧ B is equivalent to which gate's output?

• OR

• XOR

• NOT

• AND

What is the result of the NOT operation when applied to the literal 1?

• 0

• 1

• 2

• Undefined

Which gate outputs True when exactly one input is True?

• AND

• OR

• XOR

• NOT