A-level Computer Science revision · Boolean algebra and logic

Boolean laws and Karnaugh maps

The idea

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.

  1. Apply De Morgan's: break the bar and change the operator.
  2. Use absorption: A ∨ (A ∧ B) = A.
  3. In a K-map, make the largest possible groups of 1s, powers of 2.

Watch out Karnaugh map groups must be rectangles with a power-of-two number of cells, and may wrap around the edges.

See it worked

Worked example

Simplify A ∨ (A ∧ B).

  1. If A is 1, the expression is 1.
  2. If A is 0, both parts are 0.
  3. It equals A (absorption).

Answer A

Your turn

Question 11 mark

By De Morgan's law, ¬(A ∨ B) equals:

Choose one
Question 21 mark

What does A ∧ ¬A simplify to?

Choose one
Question 31 mark

Which group sizes are allowed in a four-variable Karnaugh map?

Choose one

A-level Computer Science Pro, OCR H446

A-level Computer Science Pro

£119 once

Price rises to £199 on 1 January. Save £80 by joining before then.

At least 12 months of access

By paying you agree to our Terms and get access straight away, which ends your 14-day cancellation right.

No VAT is charged.

Independent practice for OCR A-level Computer Science (H446), not endorsed by OCR.

Privacy · Terms