In Boolean algebra, the absorption law A + A·B simplifies to which expression?
- B always (A drops out completely)
- A·B always less than A in all cases
- A (A dominates the OR when A=1)
- A + B always (B added to result)
Show answer and solution
Correct answer: C. A (A dominates the OR when A=1)
Absorption: A + A·B = A·(1 + B) = A·1 = A. Companion form A·(A+B) = A. Reduces gate count in two-level minimisation (Mano Ch.2).