Boolean Algebra
This quiz covers the fundamental concepts and operations of Boolean algebra, a branch of mathematics that deals with logical operations and binary variables.
Questions
What is the dual of the expression (A ∨ B) ∧ (C ∧ D)?
- ¬(¬A ∧ ¬B) ∨ ¬(¬C ∨ ¬D)
- ¬(¬A ∨ ¬B) ∧ ¬(¬C ∧ ¬D)
- ¬(A ∧ B) ∨ ¬(C ∨ D)
- ¬(A ∨ B) ∧ ¬(C ∧ D)
Simplify the following Boolean expression: (A ∨ B) ∧ (¬A ∨ C)
- A ∨ C
- B ∨ C
- A ∨ B ∨ C
- ¬A ∨ B ∨ C
Construct the truth table for the following Boolean expression: (A ∧ B) ∨ (¬A ∧ C)
- A | B | C | (A ∧ B) ∨ (¬A ∧ C)
--- | --- | --- | ---
0 | 0 | 0 | 0
0 | 0 | 1 | 1
0 | 1 | 0 | 0
0 | 1 | 1 | 1
1 | 0 | 0 | 0
1 | 0 | 1 | 1
1 | 1 | 0 | 1
1 | 1 | 1 | 1 - A | B | C | (A ∧ B) ∨ (¬A ∧ C)
--- | --- | --- | ---
0 | 0 | 0 | 1
0 | 0 | 1 | 0
0 | 1 | 0 | 1
0 | 1 | 1 | 0
1 | 0 | 0 | 1
1 | 0 | 1 | 0
1 | 1 | 0 | 0
1 | 1 | 1 | 1 - A | B | C | (A ∧ B) ∨ (¬A ∧ C)
--- | --- | --- | ---
0 | 0 | 0 | 0
0 | 0 | 1 | 1
0 | 1 | 0 | 1
0 | 1 | 1 | 0
1 | 0 | 0 | 1
1 | 0 | 1 | 0
1 | 1 | 0 | 1
1 | 1 | 1 | 0 - A | B | C | (A ∧ B) ∨ (¬A ∧ C)
--- | --- | --- | ---
0 | 0 | 0 | 1
0 | 0 | 1 | 1
0 | 1 | 0 | 0
0 | 1 | 1 | 1
1 | 0 | 0 | 0
1 | 0 | 1 | 1
1 | 1 | 0 | 0
1 | 1 | 1 | 0
Which of the following is a valid Boolean identity?
- ¬(A ∨ B) = ¬A ∨ ¬B
- ¬(A ∧ B) = ¬A ∧ ¬B
- A ∨ B = A ∧ B
- A ∧ B = A ∨ B
Find the minimal sum-of-products form of the following Boolean expression: (A ∨ B) ∧ (¬A ∨ C) ∧ (B ∨ ¬C)
- A ∨ B ∨ C
- A ∨ C
- B ∨ C
- A ∨ B
What is the complement of the Boolean expression (A ∧ B) ∨ (¬A ∧ C)?
- ¬(A ∧ B) ∧ ¬(¬A ∧ C)
- ¬(A ∧ B) ∨ ¬(¬A ∧ C)
- (A ∨ B) ∧ (¬A ∨ C)
- (A ∨ B) ∨ (¬A ∨ C)
Which of the following Boolean expressions is equivalent to ¬(A ⊕ B)?
- A ∨ B
- A ∧ B
- ¬A ∧ ¬B
- ¬A ∨ ¬B
Simplify the following Boolean expression using Boolean algebra: (A ∨ B) ∧ (¬A ∨ ¬B)
- 0
- 1
- A ∨ B
- ¬A ∨ ¬B
Which of the following is a valid Boolean law?
- Associative law of addition
- Associative law of multiplication
- Distributive law of addition over multiplication
- Distributive law of multiplication over addition
What is the dual of the Boolean expression (A ∧ B) ∨ (¬A ∧ C)?
- ¬(¬A ∨ ¬B) ∧ ¬(A ∨ ¬C)
- ¬(¬A ∨ ¬B) ∨ ¬(A ∨ ¬C)
- ¬(A ∨ B) ∧ ¬(¬A ∨ C)
- ¬(A ∨ B) ∨ ¬(¬A ∨ C)
Simplify the following Boolean expression: (A ∨ B) ∧ (¬A ∨ C) ∧ (B ∨ ¬C)
- A ∨ B ∨ C
- A ∨ C
- B ∨ C
- A ∨ B
Which of the following is a valid Boolean identity?
- ¬(A ∨ B) = ¬A ∨ ¬B
- ¬(A ∧ B) = ¬A ∧ ¬B
- A ∨ B = A ∧ B
- A ∧ B = A ∨ B
Find the minimal sum-of-products form of the following Boolean expression: (A ∨ B) ∧ (¬A ∨ C) ∧ (B ∨ ¬C)
- A ∨ B ∨ C
- A ∨ C
- B ∨ C
- A ∨ B
What is the complement of the Boolean expression (A ∧ B) ∨ (¬A ∧ C)?
- ¬(A ∧ B) ∧ ¬(¬A ∧ C)
- ¬(A ∧ B) ∨ ¬(¬A ∧ C)
- (A ∨ B) ∧ (¬A ∨ C)
- (A ∨ B) ∨ (¬A ∨ C)
Which of the following Boolean expressions is equivalent to ¬(A ⊕ B)?
- A ∨ B
- A ∧ B
- ¬A ∧ ¬B
- ¬A ∨ ¬B