Simplify A ∨ (A ∧ B).
- If A is 1, the expression is 1.
- If A is 0, both parts are 0.
- It equals A (absorption).
Answer A
A-level Computer Science revision · Boolean algebra and logic
Boolean expressions can be simplified using laws: De Morgan's (¬(A ∧ B) = ¬A ∨ ¬B), distribution, association, commutation, double negation and absorption. Karnaugh maps group adjacent 1s in rectangles of 1, 2, 4, 8 or 16 cells (wrapping around edges) to find the simplest expression.
Watch out Karnaugh map groups must be rectangles with a power-of-two number of cells, and may wrap around the edges.
Simplify A ∨ (A ∧ B).
Answer A
By De Morgan's law, ¬(A ∨ B) equals:
What does A ∧ ¬A simplify to?
Which group sizes are allowed in a four-variable Karnaugh map?
A-level Computer Science Pro, OCR H446
£119 once
Price rises to £199 on 1 January. Save £80 by joining before then.
At least 12 months of access
No VAT is charged.