⚡ Rapid revision — the 20-minute version
| Spine | The mark |
|---|---|
| CPU cycle | Fetch → decode → execute; the program counter holds the ADDRESS |
| Memory hierarchy | Fast and small at the top; RAM volatile, ROM/SSD persistent |
| The OS | Processes, memory, files, I/O — the manager between hardware and apps |
| Networks | Star topology; DNS names→IPs; HTTPS encrypts with TLS |
| Security | CIA triad — confidentiality, integrity, availability; phishing attacks people |
| Binary | Place values 128…1 — 1101₂ = 13; convert before answering |
1. The machine in layers — hardware, OS, applications
Layer model: HARDWARE (physical circuits) → OPERATING SYSTEM (manages the hardware) → APPLICATIONS (do the user's work) → USER. Each layer serves the one above and hides the one below: a word processor writes files without knowing which sectors on which disk they land on. 'Explain the role of the OS' = the manager between hardware and applications — never 'runs programs' alone.
Worked: you save a document (application) → the OS decides where on disk it goes and updates the file table → the disk hardware stores the bits. Three layers, one save. Name what each layer CONTRIBUTES — that decomposition is the mark.
2. The CPU — fetch, decode, execute
CPU: The processor runs the CYCLE millions of times a second: FETCH the next instruction from memory (address held in the PROGRAM COUNTER), DECODE it in the CONTROL UNIT, EXECUTE it (arithmetic in the ALU, results in REGISTERS), then advance. Key parts: ALU (arithmetic/logic), CONTROL UNIT (orchestrates), REGISTERS (tiny ultra-fast storage), CLOCK (synchronises the cycle), CACHE (keeps likely-needed data close).
Worked: ADD R1, R2 — fetch the instruction at the program counter's address, decode 'add registers', execute in the ALU, result into a register, program counter advances to the next instruction. The exam traces this cycle by naming the parts in order — fetch, decode, execute — and matching each part to its job.
3. Memory — RAM, ROM, and the hierarchy
Memory hierarchy: Speed and cost rise together: REGISTERS (bytes, fastest) → CACHE (kilobytes–megabytes) → RAM (gigabytes, volatile — loses contents at power-off) → SSD/HDD (terabytes, persistent). ROM is read-only and NON-volatile — it holds the boot firmware. The hierarchy exists because fast memory is expensive: the cache keeps HOT data close, RAM holds the working set, disk holds everything.
Worked: opening an app loads it from SSD into RAM; the parts running RIGHT NOW sit in cache/registers. Power cut: RAM empties (volatile), the SSD copy survives (persistent). 'Why does more RAM help?' — the working set fits without slow disk swapping. Match the tier to the role.
4. The operating system — the four managers
| OS role | What it manages | Exam example |
|---|---|---|
| Process management | Which program runs, for how long (scheduling, multitasking) | Music playing while you browse — time slices |
| Memory management | Allocating RAM, swapping to disk when full | Too many tabs → swapping slows everything |
| File system | Organising data into files/folders, permissions | Save, rename, delete — all OS work |
| I/O + UI | Devices (keyboard, disk, network) and the interface | One API for every printer model |
The OS also handles SECURITY (users, permissions) and provides the platform applications target. The exam's trap: 'the OS executes programs' — no: the CPU executes; the OS SCHEDULES, ALLOCATES and MEDIATES. Name the manager role for the scenario given.
5. Networks — LANs, WANs and the protocols
Network: LAN: small area, owned locally (school, office — high speed). WAN: wide area, linked across locations (the Internet is the WAN of WANs). TOPOLOGIES: star (all nodes to a central switch — one cable fails, one node; hub fails, everything), bus (one backbone — cheap, one break kills all), mesh (redundant links — resilient, costly). PROTOCOLS: TCP/IP (addressing + reliable delivery), HTTP/HTTPS (web — the S is TLS encryption), DNS (names to IP addresses), DHCP (automatic IP assignment).
Worked: typing gnostiri.vercel.app — DNS resolves the name to an IP, TCP opens a reliable connection, HTTPS encrypts it, the server responds. 'Why does the school Wi-Fi use a star topology?' — one switch, easy to extend, single point of failure named honestly. Match protocol to function — DNS is the phonebook, never the transport.
6. Cybersecurity — the CIA triad and the defences
| Principle | Meaning | Threat to it | Defence |
|---|---|---|---|
| Confidentiality | Only authorised eyes | Eavesdropping, data theft | Encryption, access control |
| Integrity | Data unchanged by accident or malice | Tampering, corruption | Hashes, checksums, permissions |
| Availability | Service up when needed | DDoS, ransomware, outages | Backups, redundancy, updates |
Threats: MALWARE families (virus attaches to files, worm self-spreads, trojan disguises as useful, ransomware encrypts for payment), PHISHING (fake messages harvesting credentials), man-in-the-middle (intercepted traffic). Defences in depth: strong unique passwords, two-factor authentication, encryption at rest and in transit, firewalls, timely updates, tested backups — and USERS trained, because phishing attacks people, not code.
Worked: an email from 'the IT department' asking for your password — phishing: it attacks TRUST, so the defence is verification and training, not antivirus. Ransomware encrypts the disk — the defence that always works is an OFFLINE backup: restore, never pay. Match threat → defence; the CIA label is the mark.
7. Data representation — bits, bytes, binary
Binary: Computers store everything as BITS (0/1). 8 bits = 1 byte; 1024 bytes = 1 KB (binary prefixes). A byte encodes 256 values: text via ASCII/Unicode (one code per character), numbers in base 2 (128 64 32 16 8 4 2 1 place values), images as pixel grids, sound as samples. Conversions: 1011₂ = 8+0+2+1 = 11; 13 = 1101₂. Hex (base 16) shortens binary for humans: one hex digit = 4 bits.
Worked: 1101₂ → 8 + 4 + 0 + 1 = 13. Convert 25 → 11001₂ (16+8+1). The place-value table is the method — write it, fill it, read it. Character encoding question: 'A' is 65 in ASCII, stored as 01000001. Show the working; the answer alone earns half.
8. Summary — the computer systems spine
| Question type | Method beat | Trap |
|---|---|---|
| CPU cycle | Fetch → decode → execute, parts named | Program counter holds the ADDRESS, not the data |
| Memory | Tier × volatility × role | RAM volatile, ROM/SSD persistent |
| OS role | Name the manager for the scenario | The CPU executes; the OS schedules |
| Networks | Topology + protocol matched to function | DNS resolves names; it does not carry traffic |
| Security | CIA label + threat + defence | Phishing attacks people — training is the fix |
| Binary | Place-value table, then read | 1101₂ is 13, not 1101 |
Command discipline: 'describe' = the component and its function; 'explain why' = the trade-off (speed vs cost, resilience vs expense); 'state' = the single fact, no waffle. Systems papers pay for the ROLE of each component in the scenario — a parts list without the role earns half.