SHSubjectHub

Sets, regular expressions and regular languages

AQA 75174.4 L3A-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.

  • 13 questions
  • 34 marks
  • about 35 minutes
  • marked instantly

Question types: short answer, true or false, matching, multiple choice.

Try it with a class, freeHow it works

Try one from this worksheet

State the cardinality of the set {x | x ∈ ℕ ∧ x < 5}.

Pick an answer: it's marked straight away, just as your pupils would see it.

About this resource

AQA A-level Computer Science (7517) 4.4.2.2 Maths for regular expressions · 4.4.2.3 Regular expressions · 4.4.2.4 Regular language. C# lesson 3 of 6 in 4.4 Theory of computation: a trace-the-fsm Do Now, a short key idea, a 10-challenge ladder in three sets with exact test data, two exam questions…

19 slides.

Lesson outline

  1. Do Now: trace the state machine
  2. Do Now: answers
  3. Key idea: Sets and set notation
  4. Key idea: Set operations, in maths and in C#
  5. Key idea: Regular expressions describe sets of strings
  6. Key idea: In C#: anchor every pattern
  7. Key idea: Regular expression → FSM: building blocks
  8. Key idea: Both ways, and regular languages
  9. Set 1: building sets
  10. Set 2: set operations
  11. Exam question E1: two sets
  12. Model answer E1
Unit bundle4.4 Theory of computation · full lessons
Part of: 4.4 Theory of computation · full lessons: the whole unitEvery resource in the unit in one zip.

More from 4.4 Theory of computation · full lessons