Boolean Logic · 5 question types
Past paper frequency (2018 to 2024)
This topic accounts for approximately 6% of your exam marks.
Writing Boolean expressions from logic diagrams and simplifying using laws appear regularly.
De Morgan's Laws describe what happens when a NOT is applied to a whole bracket. They are the most important pair of laws for simplification questions.
De Morgan #1:
¬(A · B) = ¬A + ¬BDe Morgan #2:
¬(A + B) = ¬A · ¬B
In words: distribute the NOT onto every variable in the bracket, then flip the connective (· becomes +, and + becomes ·).
A two-step recipe that always works:
¬ on every variable inside the bracket.