De Morgan's laws
Logical equivalences describing relationships between AND, OR, and NOT operators. De Morgan's laws enable Boolean expression simplification.
Formula
NOT (A AND B) = (NOT A) OR (NOT B); NOT (A OR B) = (NOT A) AND (NOT B)
Real World
Google's search engine uses De Morgan's laws to optimise query filters — searching for 'NOT (Python AND Java)' is internally rewritten to 'NOT Python OR NOT Java' to match its index structure faster.
Exam Focus
Remember: NOT flips the operator (AND becomes OR) and negates each input — practise by verifying with truth tables.
How well did you know this?