SHSubjectHub

Boolean Algebra & De Morgan's Laws

AQA 75174.6.5A-levelLesson packSubscription
Also online

This worksheet marks itself

Set it as homework or classwork and every answer is marked as pupils go, with feedback on what they got wrong. The scores go straight into your mark book, so you can see who needs help before the next lesson.

  • 10 questions
  • 25 marks
  • about 40 minutes
  • marked instantly

Question types: multiple choice, truth table.

Try it with a class, freeHow it works

About this resource

Use Boolean identities (identity, null, idempotent, complement, absorption) and De Morgan's laws to manipulate and simplify Boolean expressions, recognising that a simplified form is not always unique.

20 slides.

Lesson outline

  1. Retrieval: Logic Gates & Circuits (4.6c)
  2. Key Vocabulary
  3. Quick Check: Retrieval
  4. Why Simplify a Boolean Expression?
  5. Six Core Identities
  6. Rearranging & Distributing
  7. Hinge Question: A+A
  8. Worked Example: A Full Simplification
  9. Task (We Do): Guided Simplification 1
  10. De Morgan's Law: Break the Bar, Flip the Operator
  11. Hinge Question: De Morgan's Law
  12. Task: Prove De Morgan's Law with a Truth Table
Unit bundlePaper 2
Part of: Paper 2: the whole unitEvery resource in the unit in one zip.

More from 4.6 Fundamentals of computer systems