SHSubjectHub

Abstraction, decomposition and automation

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

  • 12 questions
  • 38 marks
  • about 35 minutes
  • marked instantly

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

Try it with a class, freeHow it works

Try one from this worksheet

Identify the example of representational abstraction.

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.1 Abstraction and automation: problem-solving, algorithms, abstraction, information hiding, procedural, functional and data abstraction, reduction, decomposition, composition, automation. C# lesson 1 of 6 in 4.4 Theory of computation: a solve-the-logic-puzz…

18 slides.

Lesson outline

  1. Do Now: solve the seating puzzle
  2. Do Now: answers
  3. Key idea: Algorithms: trace, check, then code
  4. Key idea: Abstraction: leave out, group, reduce
  5. Key idea: Procedural and functional abstraction
  6. Key idea: Data abstraction and information hiding
  7. Key idea: Decomposition and composition
  8. Set 1: algorithms and logic problems
  9. Set 2: generalise, then compose
  10. Exam question E1: who has which locker?
  11. Model answer E1
  12. Exam question E2: data abstraction and information hiding
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