Boolean Algebra Practice
70 questions with step-by-step walkthroughs for A-Level Computer Science
Q1 of 9
Basic Laws
Simplify / Prove
Quick Reference: Boolean Laws
IdempotentA AND A = A
A OR A = A
A OR A = A
IdentityA AND 1 = A
A OR 0 = A
A OR 0 = A
NullA AND 0 = 0
A OR 1 = 1
A OR 1 = 1
ComplementA AND NOT A = 0
A OR NOT A = 1
A OR NOT A = 1
Double negationNOT (NOT A) = A
AbsorptionA OR (A AND B) = A
A AND (A OR B) = A
A AND (A OR B) = A
DistributiveA AND (B OR C) = (A AND B) OR (A AND C)
De Morgan'sNOT(A AND B) = NOT A OR NOT B
NOT(A OR B) = NOT A AND NOT B
NOT(A OR B) = NOT A AND NOT B
NANDA NAND B = NOT(A AND B)
= NOT A OR NOT B
= NOT A OR NOT B
NORA NOR B = NOT(A OR B)
= NOT A AND NOT B
= NOT A AND NOT B