The Fetch–Execute Cycle
AQA 75174.7.3A-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.
- 9 questions
- 38 marks
- about 50 minutes
- marked instantly
Question types: multi-part, multiple choice, fill the gap, matching, ordering.
About this resource
Explain how the fetch–execute cycle is used to execute machine-code programs, including the three stages (fetch, decode, execute) and the exact register transfers — PC, MAR, MBR/MDR and CIR — that occur at each stage.
18 slides.
Lesson outline
- Retrieval: Registers Recap (from last lesson)
- Key Vocabulary
- Hinge Question: What Does the PC Actually Store?
- One Cycle, Billions of Times a Second
- Stage 1: FETCH — the Register Transfers
- Task: Order the Fetch-Stage Steps
- Stage 2: DECODE
- Hinge Question: Which Register Gets Decoded?
- Stage 3: EXECUTE
- The Full Fetch–Execute Cycle
- Task: Which Register, At Which Stage?
- Hinge Question: MAR or MBR?
Unit bundlePaper 2
More from 4.7 Computer organisation and architecture
- Lesson pack · 4.7.1–4.7.2Internal Components, Buses & Von Neumann ArchitectureSubscription
- Lesson pack · 4.7.3Instruction Sets & Addressing ModesSubscription
- Lesson pack · 4.7.3The Processor & Its RegistersSubscription
- Lesson pack · 4.7.3–4.7.4Processor Performance, Interrupts, IO and Secondary StorageSubscription
- Lesson pack · 4.7.5AQA Assembly LanguageSubscription
- Knowledge organiser · 4.7Computer Organisation and ArchitectureSubscription
- Scheme of work · 4.7Computer Organisation and ArchitectureSubscription


