SHSubjectHub

Abstraction and Automation

AQA 75174.4.1A-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
  • 43 marks
  • about 55 minutes
  • marked instantly

Question types: multi-part, multiple choice, true or false, fill the gap, matching.

Try it with a class, freeHow it works

About this resource

AQA A-level Computer Science (7517) Paper 1, 4.4.1 Abstraction and automation — problem-solving, algorithms and pseudocode, the seven kinds of abstraction (representational, generalisation, information hiding, procedural, functional, data, problem abstraction/reduction), decomposition, compositio…

32 slides.

Lesson outline

  1. Do Now — Retrieval
  2. I-Do: Problem-Solving, and What Is an Algorithm?
  3. We-Do — Solve, Check, and Define
  4. I-Do: Pseudocode — the Standard Constructs
  5. I-Do: Hand-Tracing an Algorithm
  6. Hinge Check — What MUST an Algorithm Do?
  7. We-Do — Hand-Trace and Convert to Python
  8. I-Do: Correctness and Efficiency
  9. I-Do: Representational Abstraction
  10. I-Do: Abstraction by Generalisation
  11. Hinge Check — Representational vs Generalisation
  12. I-Do: How the Two Combine Into a Model
Unit bundlePaper 1
Part of: Paper 1: the whole unitEvery resource in the unit in one zip.

More from 4.4 Theory of computation