Computer Systems: Hardware, Software and Networks

---

Concepts

This study delivers 1 primary concept and 0 secondary concepts.

Primary concept: Boolean Logic and Binary (CO-KS34-C002)

Type: Knowledge | Teaching weight: 3/6

Boolean algebra is the branch of mathematics that deals with variables that can take only two values (true/false, 1/0). Boolean logic operations (AND, OR, NOT, NAND, NOR, XOR) are the fundamental operations of digital computing, implemented in hardware as logic gates. Binary (base 2) is the number system used by digital computers, where all data is represented as sequences of 0s and 1s. Understanding binary representation of integers, converting between binary and decimal, and performing binary arithmetic are foundational to understanding how computers store and process all types of data. Boolean logic connects programming (where logical conditions control program flow) to hardware (where logic gates implement digital circuits).

Teaching guidance: Teach Boolean operations through truth tables before connecting to programming and hardware. Use logic gate diagrams to show how Boolean operations are implemented physically. Practice binary-to-decimal and decimal-to-binary conversion systematically. Teach binary addition with carries. Connect to programming: the Boolean conditions in if statements and while loops use the same Boolean logic. Discuss how images, sound and text are encoded in binary: different data types, same underlying representation. Use physical logic gate simulations where possible. Key vocabulary: Boolean, binary, bit, byte, AND, OR, NOT, truth table, logic gate, convert, decimal, hexadecimal, unsigned, signed, twos complement, overflow Common misconceptions: Pupils often confuse binary (a number system) with a code for letters or colours, not realising it is a general-purpose representational system for any data. The fact that 0 and 1 in binary do not mean 'nothing' and 'one' but represent powers of two needs explicit teaching. Boolean AND requiring both inputs to be true (not either), and the counterintuitive behaviour of NAND and NOR gates, are common points of confusion requiring careful attention to truth tables.

Differentiation

Model response (Emerging): 13 divided by 2 = 6 remainder 1. 6 divided by 2 = 3 remainder 0. 3 divided by 2 = 1 remainder 1. 1 divided by 2 = 0 remainder 1. Reading the remainders from bottom to top: 13 in binary is 1101.

Model response (Developing): Truth table (A, B, C, NOT C, B OR NOT C, A AND (B OR NOT C)):

0,0,0,1,1,0 | 0,0,1,0,0,0 | 0,1,0,1,1,0 | 0,1,1,0,1,0 | 1,0,0,1,1,1 | 1,0,1,0,0,0 | 1,1,0,1,1,1 | 1,1,1,0,1,1.

Binary addition: 0110 + 0011. Rightmost column: 0+1=1. Second column: 1+1=10, write 0 carry 1. Third column: 1+0+1(carry)=10, write 0 carry 1. Fourth column: 0+0+1(carry)=1. Result: 1001 (which is 9 in decimal: 6+3=9, correct).

Model response (Secure): A 24-bit colour pixel uses 8 bits for each of the three colour channels: red, green and blue (RGB). Each channel has 8 bits, giving 2 to the power of 8 = 256 possible intensity levels (0-255) per channel. The total number of different colours is 256 x 256 x 256 = 16,777,216 (approximately 16.7 million). For example, pure red is (11111111, 00000000, 00000000) = (255, 0, 0); white is (11111111, 11111111, 11111111) = (255, 255, 255); black is (00000000, 00000000, 00000000). A 1920x1080 screen has 2,073,600 pixels, each storing 24 bits, so a single uncompressed frame requires approximately 6.2 megabytes of data.

Model response (Mastery): Inputs: D = door sensor (1 = open), A = armed (1 = armed), P = panic button (1 = pressed). Output: S = alarm sounds. Boolean expression: S = (D AND A) OR P. Circuit: Wire D and A into an AND gate (output = D AND A). Wire the AND gate output and P into an OR gate (output = (D AND A) OR P). The OR gate output drives the alarm. Verification: Door open + armed + no panic: (1 AND 1) OR 0 = 1 → alarm sounds (correct). Door closed + armed + no panic: (0 AND 1) OR 0 = 0 → no alarm (correct). Door open + not armed: (1 AND 0) OR 0 = 0 → no alarm (correct — the system is disarmed). Panic pressed (any state): anything OR 1 = 1 → alarm always sounds (correct — panic overrides everything). This demonstrates how complex real-world logic is implemented using simple binary gates — every digital system, from alarms to processors, is built from combinations of these fundamental operations.

---

Thinking lens: Systems and System Models (primary)

Key question: What are the parts of this system, how do they interact, and what happens when something changes? Why this lens fits: Computer architecture is a hierarchical system — logic gates compose into circuits, circuits into functional units, units into a CPU — and pupils must understand how each level of the system is built from simpler components at the level below. Question stems for KS3:

What feedback loops exist in this system?

Does this model capture all the important interactions, or does it oversimplify?

What emergent property arises from these components interacting?

How would removing or adding a component change the system's behaviour?

Secondary lens: Patterns — Binary representation uses a positional pattern (place values as powers of 2) that applies identically whether representing integers, colours or characters — recognising the same underlying pattern across different data types is a key generalisation at this level.

---

Session structure: Research Enquiry

Research Enquiry

A structured approach to answering questions through secondary research. Pupils formulate a research question, select appropriate sources, take and organise notes, synthesise findings from multiple sources, and present their conclusions. Develops information literacy alongside subject knowledge.

question → source_selection → note_taking → synthesis → presentation Assessment: Research report or presentation that answers the original question using evidence from multiple sources, with evaluation of source reliability where appropriate. Teacher note: Use the RESEARCH ENQUIRY template: frame a focused research question and guide pupils to select, evaluate, and synthesise information from multiple sources. Expect critical evaluation of source reliability and relevance. Prompt pupils to organise their findings thematically, note areas of agreement and disagreement between sources, and present a coherent synthesis. KS3 question stems:

How did you select your sources, and what criteria did you use?

Where do your sources agree, and where do they contradict each other?

How reliable is each source for answering this specific question?

How would you synthesise these findings into a coherent answer?

---

Computing focus

Computational concepts: computer architecture, networking Abstraction level: Physical Themes: computer systems, hardware, networks

---

Why this study matters

Understanding how a computer works (CPU, memory, storage, I/O devices) connects the abstract world of programming to physical hardware. The fetch-decode-execute cycle explains how a processor executes instructions stored in memory. Network concepts (LAN, WAN, protocols, IP addressing, client-server vs peer-to-peer) explain how computers communicate. Disassembling an old computer (under supervision) and identifying components is the most memorable lesson in KS3 computing.

---

Pitfalls to avoid

Teaching hardware as a list of components without explaining how they interact -- use the fetch-decode-execute cycle as the narrative thread

Network concepts too abstract -- use physical role-play: pupils as routers passing 'packet' cards

Not distinguishing RAM from storage -- demonstrate by opening too many browser tabs (RAM fills up) vs saving a file (storage)

---

Computational thinking skills (KS3)

These disciplinary skills should be woven through teaching, not taught in isolation:

Algorithm design (KS1) — Create precise, unambiguous sequences of instructions to accomplish a goal; understand that a computer follows instructions exactly as written; design, implement and debug simple programs as algorithms expressed in a programming environment; use logical reasoning to predict what a simple program will do.

Pattern recognition (KS2) — Identify patterns and regularities in data sets and program behaviours; use pattern recognition to select appropriate control structures (repetition for repeated actions, selection for conditional branching); generalise from specific examples to produce reusable solutions; recognise when an existing algorithm or program component can be reused to solve a new problem.

Pattern recognition (KS3) — Identify and exploit structural patterns in computational problems to select or design efficient algorithms; recognise recurring algorithmic patterns such as searching, sorting and divide-and-conquer; use pattern recognition to understand when different data structures naturally suit a problem's access patterns; analyse trends in data and use them to inform computational solutions.

Abstraction (KS1) — Focus on the most important features of a problem or task while ignoring unnecessary detail; represent real-world actions as simple step-by-step instructions that capture the essential logic without irrelevant specifics.

Pattern recognition (KS1) — Notice repeated elements in sequences of instructions or in real-world tasks; identify when a set of steps recurs and recognise that repetition can be expressed more efficiently using loops; spot similarities between different problems that suggest the same solution approach can be applied.

Data representation (KS3) — Understand how data of various types — integers, text, images, sound — is represented and manipulated in binary form; convert between binary and decimal number representations and perform simple binary arithmetic; understand how data structures (arrays, lists, records) organise data in programs; understand that all digital information is encoded as binary digits regardless of its perceived type.

---

Vocabulary word mat

Scaffolding and inclusion (Y7)

---

Knowledge organiser

Key terms:

CPU

RAM

ROM

storage

motherboard

input

output

fetch-decode-execute

bus

LAN

WAN

protocol

IP address

packet

Core facts (expected standard):

Boolean Logic and Binary: Connects Boolean logic to both programming (conditional statements) and hardware (logic gates), understands how different data types are represented in binary, and applies binary arithmetic confidently.

---

Graph context

Node type: ComputingTopicSuggestion | Study ID: TS-CO-KS3-004 Concept IDs:

CO-KS34-C002: Boolean Logic and Binary (primary)

Cypher query:

``cypher

MATCH (ts:ComputingTopicSuggestion {suggestion_id: 'TS-CO-KS3-004'})

-[:DELIVERS_VIA]->(c:Concept)

-[:HAS_DIFFICULTY_LEVEL]->(dl)

RETURN c.name, dl.label, dl.description

``

---

Generated from the UK Curriculum Knowledge Graph — zero LLM generation.