GCSE · Computer Science · AQA · Spec 8525
Von Neumann architecture
Your phone is a camera one minute and a calculator the next, with no rewiring. So where does the program actually live? In memory, stored just like data.
Stored program · step by step
Follow a tiny program out of memory
Main memory has six locations here, numbered 0 to 5. Addresses 0 to 3 hold the program's instructions; addresses 4 and 5 hold its data. They are written as words and numbers so you can read them. Inside a real computer, every one of them is stored in binary.
Predict first: at step 3, will the CPU be reading an instruction or a piece of data from memory?
Phase: Fetch
Addr 0
▶ LOAD 4
Addr 1
ADD 5
Addr 2
OUTPUT
Addr 3
STOP
Addr 4
7
Addr 5
3
Address sent
0
On the bus
LOAD 4 (instruction)
CPU holds
—
Output
Step 1: The CPU sends address 0 to memory. Back along the bus comes an instruction: LOAD 4.
Press Next one step at a time. ▶ marks the memory location being used. Watch which address the CPU asks for, and whether an instruction or data comes back.
Computer Science · Structure
The parts of a von Neumann computer
Tap each part. The lines are buses: pathways that carry instructions and data between the parts.
Tap any part of the diagram to see what it does.
Taking turns
Reason it through
Why can't the CPU fetch an instruction and the data it needs at the same moment?
First link · your turn
Where do the instructions and the data both live?
WHAT YOU'VE LEARNED
A quick recap of today's lesson.
The program lives in memory, right next to the data it works on.
What you need to know
- The main parts are the CPU, main memory, input devices and output devices, connected by buses.
- Main memory stores the program's instructions and the data, together, in binary.
- Every location in main memory has its own address, which is how the CPU finds what it needs.
- The CPU fetches an instruction from memory, decodes it, executes it, then moves on to the next one.
- Instructions and data share the same buses, so they travel one transfer at a time.
The big picture
In the von Neumann architecture a computer has a CPU, one main memory, input devices and output devices, joined by buses. Main memory holds both the program's instructions and the data they use, in binary, each at its own address. The CPU fetches instructions from memory one at a time, decodes them and executes them. Because instructions and data share one memory and the same buses, they are transferred one after the other.
Key points
Worked example
Problem
Main memory holds: address 10: LOAD 20, address 11: SUBTRACT 21, address 12: STORE 22, address 13: STOP, address 20: 9, address 21: 4, address 22: 0. LOAD copies a value into the CPU, SUBTRACT takes a value away from the one the CPU holds, and STORE writes the CPU's value into memory. The CPU starts at address 10. How many transfers happen between memory and the CPU, and what does address 22 hold at the end?
⚠ Watch out
Writing that the program is "stored in the CPU". The CPU carries out the instructions, but the program is stored in main memory, in the same memory as the data.
Memory hook
Picture a row of numbered lockers with one corridor to the CPU. Program and data share the lockers, and only one thing can walk down the corridor at a time. (Unlike real lockers, every one holds nothing but binary.)
Check yourself
Without scrolling up: name the four main kinds of part, say where a running program is kept and what shares that space, and explain why an instruction and its data cannot arrive together.
Flashcards
(11)What is the stored-program concept?
Name the main parts of a von Neumann computer.
What is a bus?
In what form are instructions and data held in main memory?
What is a memory address?
Address or contents? "Location 4 holds 7"
What are the three stages the CPU repeats for every instruction?
What happens in the decode stage?
What has to change for a computer to run a different program?
Why can't an instruction and its data be fetched at the same time?
What do input and output devices do?
Tap any card to flip it, or use Study as deck to go through them one at a time. In the full lesson these run as a spaced-repetition deck — you rate each card Hard, Good or Easy and the tricky ones keep coming back until they stick.
Learning with Lightbulb is opening soon
You can use this lesson now. Join the waitlist and we'll let you know when the full Lightbulb experience is ready.
Keep me postedMore AQA GCSE Computer Science topics
How this lesson was checked. This AQA GCSE Computer Science (specification 8525)lesson was published through Lightbulb Learning's human-designed editorial process — the educational standards, accuracy rules and publication checks it must pass were authored and approved by Philip Halpin. It passed subject-specific assessment, automated educational checks and technical publication verification before going live (publication checks completed 30 September 2026). Published pages are monitored, human spot-checking is ongoing across the lesson library, and anything found wrong is corrected or withdrawn. How our lessons are made and checked. Spotted a mistake? Email hello@lightbulblearning.co and we'll review it.