1.4.3. Boolean Algebra

Simplify the following Boolean expression: ¬B∧¬A∨¬B

• ¬B∧¬A

• ¬A∧¬B

• ¬B∨¬A

• ¬A∨¬B

• ¬B

What Boolean operation is represented with ¬?

• NOT
• AND
• OR
• XOR
• NOR

What Boolean operation is represented with ∧?

• AND
• OR
• XOR
• NOT
• NOR

What Boolean operation is represented with ∨?

• OR
• XOR
• NOT
• NOR
• AND

What Boolean operation is represented with ⊕?

• XOR
• NOT
• AND
• OR
• NOR

Which has the highest order of precedence: AND, OR or NOT?

• NOT
• AND
• OR
• XOR
• NOR

Complete the Boolean identity: C ∧ C =

• C
• C V C
• ¬C
• ¬C V C
• ¬C ∧ ¬C

Simplify the following Boolean expression: (C ∨ (B ∨ ¬B)) ∧ D

• D
• C
• B
• ¬C
• ¬D

Complete the Boolean identity: B ∧ 1 =

• B
• ¬B
• B ∧ B
• B V B

Apply one of De Morgan’s Laws to the following Boolean expression: ¬A ∧ ¬B

• ¬(A∨B)
• ¬(A∧B)
• ¬(A∨¬B)
• (¬A∨B)
• (A∨B)