This is one of the densest theory subtopics — it covers how a CPU actually executes an instruction, how the OS juggles multiple programs, and how the system copes when RAM isn't enough.
The Machine Cycle is the repeating sequence every single CPU instruction goes through:
| Step | What happens |
|---|---|
| Fetch | The CU retrieves the next instruction from memory (RAM), using the address in a special register |
| Decode | The CU translates the fetched instruction into signals the rest of the CPU understands |
| Execute | The ALU (or other CPU part) actually performs the operation |
| Store | The result is written back to a register or memory |
Processing techniques — comparing software and hardware approaches to doing more than one thing at once:
Virtual memory — a technique the OS uses when RAM fills up:
Example
You open 15 browser tabs and your 8GB RAM fills up. The OS starts paging the least-recently-used tabs to your SSD's swap file. Switching back to one of those tabs feels sluggish because the OS has to read that data back from the (much slower) SSD into RAM before you can use it again.
💡 Exam Tip
Don't confuse an interrupt with an IRQ: the interrupt is the event/signal itself; the IRQ is the identifying line/number that tells the CPU which device raised it.