SHSubjectHub

Sets, Regular Expressions and Regular Languages

AQA 75174.4.2A-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.

  • 11 questions
  • 45 marks
  • about 60 minutes
  • marked instantly

Question types: short answer, multiple choice, true or false, fill the gap, calculation.

Try it with a class, freeHow it works

About this resource

AQA A-level Computer Science (7517) Paper 1, 4.4.2.2 Maths for regular expressions (sets), 4.4.2.3 Regular expressions, and 4.4.2.4 Regular language — set notation and comprehension, finite/infinite/countably infinite sets, cardinality, Cartesian product, subset/proper subset, set operations (mem…

32 slides.

Lesson outline

  1. Do Now — Retrieval: FSMs From Last Lesson
  2. I-Do: Set Notation and Set Comprehension
  3. Quick Check — Reading Set Comprehension Notation
  4. I-Do: The Empty Set, and Set Construction in Code
  5. I-Do: Compact Representation of an Infinite Set
  6. Hinge Check — Is {0ⁿ1ⁿ | n ≥ 1} Finite or Infinite?
  7. I-Do: Finite, Infinite, Countably Infinite Sets — and Cardinality
  8. We-Do — Check Your Understanding: Membership, Cardinality, Finite/Infinite
  9. I-Do: The Cartesian Product of Two Sets
  10. We-Do — Worked Example: Cartesian Product
  11. I-Do: Subset, Proper Subset, Countable Set
  12. Hinge Check — Subset or Proper Subset?
Unit bundlePaper 1
Part of: Paper 1: the whole unitEvery resource in the unit in one zip.

More from 4.4 Theory of computation