GCSE Computer Science Paper 1
Covers CPU and the Fetch-Execute Cycle, Memory and Storage, Networks, Topologies and Protocols and 9 more.
GCSE Computer Science
Original practice papers from our own question bank, each with a full model-solution mark scheme.
Prefer to work in your GCSE workspace? Open GCSE Computer Science mock papers.
Covers CPU and the Fetch-Execute Cycle, Memory and Storage, Networks, Topologies and Protocols and 9 more.
Covers CPU and the Fetch-Execute Cycle, Memory and Storage, Networks, Topologies and Protocols and 9 more.
Covers CPU and the Fetch-Execute Cycle, Memory and Storage, Networks, Topologies and Protocols and 9 more.
Covers CPU and the Fetch-Execute Cycle, Memory and Storage, Networks, Topologies and Protocols and 9 more.
Covers CPU and the Fetch-Execute Cycle, Memory and Storage, Networks, Topologies and Protocols and 3 more.
Covers Searching and Sorting Algorithms, Algorithm Design and Trace Tables, Programming Constructs and 3 more.
Covers the CPU and the fetch-execute cycle, memory and storage, binary and hexadecimal number systems, logic gates and boolean logic, and operating systems and utility software.
Covers binary and hexadecimal number systems, logic gates and boolean logic, operating systems and utility software, networks, topologies and protocols, programming constructs, and algorithm design and trace tables.
Covers the CPU and the fetch-execute cycle, memory and storage, logic gates and boolean logic, operating systems and utility software, networks, topologies and protocols, programming constructs, and algorithm design and trace tables.
Covers the CPU and the fetch-execute cycle, memory and storage, binary and hexadecimal number systems, networks, topologies and protocols, programming constructs, and algorithm design and trace tables.
Covers the CPU and the fetch-execute cycle, memory and storage, binary and hexadecimal number systems, logic gates and boolean logic, operating systems and utility software, networks, topologies and protocols, and algorithm design and trace tables.
Covers the CPU and the fetch-execute cycle, memory and storage, binary and hexadecimal number systems, logic gates and boolean logic, operating systems and utility software, networks, topologies and protocols, programming constructs, and algorithm design and trace tables, across the whole Year 10 course.
Covers the CPU and the fetch-execute cycle, memory and storage, networks, topologies and protocols, cyber security threats and measures, operating systems and utility software, and ethics, law and environmental impact.
Covers searching and sorting algorithms, algorithm design and trace tables, programming constructs, logic gates and boolean logic, binary and hexadecimal number systems, and representing text, images, sound and compression.
Covers the CPU and the fetch-execute cycle, memory and storage, networks, topologies and protocols, cyber security threats and measures, operating systems and utility software, algorithm design and trace tables, programming constructs, and binary and hexadecimal number systems.
Covers searching and sorting algorithms, algorithm design and trace tables, programming constructs, logic gates and boolean logic, ethics, law and environmental impact, representing text, images, sound and compression, and binary and hexadecimal number systems.
Covers the CPU and the fetch-execute cycle, memory and storage, networks, topologies and protocols, cyber security threats and measures, operating systems and utility software, searching and sorting algorithms, and representing text, images, sound and compression.
Covers the CPU and the fetch-execute cycle, binary and hexadecimal number systems, logic gates and boolean logic, operating systems and utility software, algorithm design and trace tables, ethics, law and environmental impact, searching and sorting algorithms, and representing text, images, sound and compression.
These bands follow a typical teaching order. No exam board defines what belongs to Year 10, and schools sequence the course differently. Check the split against your own scheme of work before using it to decide what a class has covered.
This Year 10 and Year 11 split follows typical scheme-of-work sequencing and is not stated by any exam board. GCSE Computer Science specifications describe content, not a two-year teaching calendar, so centres order and pace these topics differently depending on staffing and timetabling, and some interleave the computer systems and programming strands across both years. Treat it as a reasonable default, not a fact about any real school. The least certain placement is networks and topologies: nothing forces it into Year 10, so some schools teach it later, closer to cyber security, rather than as foundational early content.
Pick the topics, add the student's name and print one PDF.