Community
Community resources
Computer science Worksheets and Python Workspaces shared by Coding Pathway teachers. Worksheets cover exam board theory as well as programming. Read any of them in full here. Teachers can copy one into their own lessons and edit it before setting it to a class.
Planning a whole course or unit? Our mapped pages put the teaching sequence in order with the Worksheets that cover it: OCR GCSE Computer Science (J277), Pearson Edexcel GCSE Computer Science (1CP2), OCR A Level Computer Science (H446), Python Turtle for Key Stage 3.
- 438 resources
- 3 teachers sharing
- Creative Commons licensed
Assessment
Showing 25 to 41 of 41. Newest first. Opening a resource shows the whole thing, with answers and marking held back.
1CP2-CT-8.5 Tracing debugging sorting and searching checkpoint
Part 5 · 1CP2-CT-8 · Tracing, debugging, sorting and searching
This checkpoint assesses the CT-8 series only. Recall: a trace records changed state in execution order; syntax, runtime and logic errors differ; bubble sort compares adjacent items; binary search requires sorted data and discards half of its remaining range. Students will: - complete a formal trace with reduced support - apply bubble sort and binary search by hand - diagnose a logic error from evidence - amend and retest a search program Inside: 5 explanation cells, 1 fill-in-the-blanks cell, 2 multiple-choice questions, 1 trace table, 5 written answers and 1 Python task. 20 marks, about 45 minutes. Series: 1CP2-CT-8 · Tracing, debugging, sorting and searching, part 5 of 5.
Worksheet1CP2-CT-10.5 Final computational thinking and programming checkpoint
Part 5 · 1CP2-CT-10 · Integrated programming and data structures
This is the collection's Paper 2 transition. It samples two-dimensional data, subprogram interfaces, testing, tracing and correction. Read each requirement carefully; exact output and returned values are different demands. Students will: - decompose an integrated programming requirement - trace two-dimensional data and subprogram state - design tests with explicit expected results - write and reason about a complete PLS-compatible solution Inside: 3 explanation cells, 1 fill-in-the-blanks cell, 5 written answers, 1 trace table, 1 Python task and 1 multiple-choice question. 20 marks, about 45 minutes. Series: 1CP2-CT-10 · Integrated programming and data structures, part 5 of 5.
Worksheet1CP2-CT-9.4 Test trace debug and search checkpoint
Part 4 · 1CP2-CT-9 · Testing, structures and integrated solutions
This checkpoint assesses CT-9 and retrieves the formal methods needed to use it. It introduces no new list, file, trace or error technique. Students will: - select tests with inputs, expected results and reasons - trace list traversal and search state - diagnose a defect from its observed behaviour - amend and test a complete search without unsupported shortcuts Inside: 4 explanation cells, 1 fill-in-the-blanks cell, 4 written answers, 1 trace table, 2 multiple-choice questions and 1 Python task. 19 marks, about 45 minutes. Series: 1CP2-CT-9 · Testing, structures and integrated solutions, part 4 of 4.
Worksheet1CP2-P-6.8 Networks checkpoint
Part 8 · 1CP2-P-6 · Networks
The checkpoint for the whole networks series, sampling LAN and WAN, the internet, performance, media and topologies. Students will: - explain two differences between a LAN and a WAN - describe how DNS, IP addresses and routers deliver a request - construct a transmission-time expression with correct conversions - explain fibre transmission and one advantage over copper - give one advantage and one disadvantage of replacing wired with wireless Inside: 2 explanation cells, 1 multiple-choice question and 9 written answers. 20 marks, about 45 minutes. Series: 1CP2-P-6 · Networks, part 8 of 8.
Worksheet1CP2-CT-2.8 Selection and while-loop checkpoint
Part 8 · 1CP2-CT-2 · Selection, strings and while loops
The checkpoint for the whole series, sampling strings, selection and while loops in one integrated task. Students will: - use string methods accurately and say what they leave unchanged - write a condition for an inclusive range - correct a wrongly ordered selection chain - state the complete output and final value of a loop - write an integrated program and choose a boundary test for it Inside: 7 explanation cells, 2 multiple-choice questions, 1 Python task, 2 fill-in-the-blanks cells and 4 written answers. 20 marks, about 45 minutes. Series: 1CP2-CT-2 · Selection, strings and while loops, part 8 of 8.
Worksheet1CP2-CT-5.7 Merge sort file handling and authentication checkpoint
Part 7 · 1CP2-CT-5 · Merge sort, files and authentication
The checkpoint for the whole series, sampling merge sort, file modes and authentication in one sitting. Students will: - identify the first pairwise merge stage of a list - explain why a merge needs remainder handling - explain why a converted field calculates rather than concatenates - distinguish write mode from append mode with a suitable use of each - write an authentication routine and choose tests that grant and deny Inside: 4 explanation cells, 3 multiple-choice questions, 1 Python task, 1 fill-in-the-blanks cell and 4 written answers. 20 marks, about 45 minutes. Series: 1CP2-CT-5 · Merge sort, files and authentication, part 7 of 7.
Worksheet1CP2-P-4.7 Operating systems and utilities checkpoint
Part 7 · 1CP2-P-4 · Operating systems and utilities
The checkpoint for the whole series, sampling OS responsibilities, permissions and every utility the series covered. Students will: - summarise what an operating system is for - describe process and memory management under limited resources - explain how authentication and permissions combine for temporary access - recommend a backup, compression, maintenance and detection approach - correct two common utility misconceptions Inside: 3 explanation cells, 4 multiple-choice questions, 1 fill-in-the-blanks cell and 4 written answers. 20 marks, about 45 minutes. Series: 1CP2-P-4 · Operating systems and utilities, part 7 of 7.
Worksheet1CP2-CT-4.7 Formatting structures validation and search checkpoint
Part 7 · 1CP2-CT-4 · Structures, validation and search
The checkpoint for the whole series, integrating formatting, structures, validation and search. Students will: - choose the format descriptor a stated presentation requires - explain both indexes of a two-dimensional read - describe a validation routine including its control structure - state the comparisons a complete search of an absent target makes - write an integrated program and correct a fixed-row search error Inside: 4 explanation cells, 3 multiple-choice questions, 1 Python task, 1 fill-in-the-blanks cell and 3 written answers. 20 marks, about 45 minutes. Series: 1CP2-CT-4 · Structures, validation and search, part 7 of 7.
Worksheet1CP2-P-3.7 Architecture and storage checkpoint
Part 7 · 1CP2-P-3 · Architecture and storage
The checkpoint for the whole series, sampling the stored-program concept, the cycle, addressing and storage selection. Students will: - identify the feature central to the stored-program concept - describe the fetch-decode-execute cycle including registers and buses - explain a clock-speed performance claim precisely - calculate addressable locations and the resulting capacity - give a linked storage justification rather than a vague claim Inside: 7 explanation cells, 3 multiple-choice questions, 1 fill-in-the-blanks cell and 5 written answers. 20 marks, about 45 minutes. Series: 1CP2-P-3 · Architecture and storage, part 7 of 7.
Worksheet1CP2-P-2.7 Signed data and encoding checkpoint
Part 7 · 1CP2-P-2 · Signed data and encoding
The checkpoint for the whole series, sampling two's complement, shifts, hexadecimal and character encoding together. Students will: - interpret and represent 8-bit two's complement patterns - apply both a logical and an arithmetic shift correctly - explain the precision consequences of each shift type - convert between binary and hexadecimal and justify the notation - explain why 7-bit ASCII cannot serve a worldwide database Inside: 6 explanation cells, 1 multiple-choice question, 5 number cells, 1 fill-in-the-blanks cell and 3 written answers. 20 marks, about 45 minutes. Series: 1CP2-P-2 · Signed data and encoding, part 7 of 7.
Worksheet1CP2-CT-1.7 Programming foundations checkpoint
Part 7 · 1CP2-CT-1 · Programming foundations
The checkpoint for the whole Programming foundations series, drawing the six worksheets together into one integrated task. Students will: - restate algorithms, sequence and the IPO model accurately - apply decomposition and abstraction to a new system - use named storage and the correct types - diagnose an input conversion fault and give the amendment - write an integrated program and judge the evidence its tests provide Inside: 9 explanation cells, 1 multiple-choice question, 1 Python task, 3 fill-in-the-blanks cells and 2 written answers. 20 marks, about 45 minutes. Series: 1CP2-CT-1 · Programming foundations, part 7 of 7.
Worksheet1CP2-P-7.6 Embedded systems IoT and TCP IP checkpoint
Part 6 · 1CP2-P-7 · Embedded systems, IoT and TCP/IP
The checkpoint for the whole principles topic 7 series, sampling embedded systems, the Internet of Things, packet switching and TCP/IP. Students will: - define an embedded system and distinguish it from a general-purpose computer - describe the path from a sensor reading to an actuator response - state the information a packet header carries - explain how different routes still deliver one reconstructed message - name a protocol for each stated purpose and place it at its layer Inside: 2 explanation cells, 2 multiple-choice questions, 1 fill-in-the-blanks cell and 8 written answers. 20 marks, about 45 minutes. Series: 1CP2-P-7 · Embedded systems, IoT and TCP/IP, part 6 of 6.
Worksheet1CP2-P-5.6 Cybersecurity and robust software checkpoint
Part 6 · 1CP2-P-5 · Cyber security and robust software
The checkpoint for the whole series, sampling malware, vulnerabilities, social engineering, protection and robust software. Students will: - identify a social-engineering technique from a scenario - explain how unpatched software leads to loss or disruption - recommend and justify three distinct controls for a school - compare audit trails with code reviews as methods of identifying misuse - correct two common protection misconceptions Inside: 3 explanation cells, 3 multiple-choice questions, 2 fill-in-the-blanks cells and 5 written answers. 20 marks, about 45 minutes. Series: 1CP2-P-5 · Cyber security and robust software, part 6 of 6.
Worksheet1CP2-CT-7.5 Programming subprograms and libraries checkpoint
Part 5 · 1CP2-CT-7 · Subprograms, scope and libraries
The checkpoint for the whole programming topic 7 series, sampling constructs, subprograms, scope, maths methods and output formatting. Students will: - predict the output of a program that calls its own functions - trace a function call and record the values that change - define a local variable and justify limiting global ones - select the permitted method for a stated calculation - construct a program that separates calculation from presentation Inside: 4 explanation cells, 3 multiple-choice questions, 1 Python task, 1 trace table and 4 written answers. 17 marks, about 45 minutes. Series: 1CP2-CT-7 · Subprograms, scope and libraries, part 5 of 5.
Worksheet1CP2-P-1.5 Binary foundations checkpoint
Part 5 · 1CP2-P-1 · Binary foundations
The checkpoint for the whole Binary foundations series, sampling every method the four worksheets taught. Students will: - calculate state counts and unsigned maximums correctly - convert in both directions at the full 8-bit width - add positive 8-bit integers and identify overflow - explain what overflow means for a stored reading - represent and interpret two's complement patterns Inside: 7 explanation cells, 3 multiple-choice questions, 7 number cells and 1 written answer. 18 marks, about 45 minutes. Series: 1CP2-P-1 · Binary foundations, part 5 of 5.
WorksheetSeries · 2 partsJ277 Paper 2 · Exam transition
Includes J277 2 Paper 2 Section A mixed practice
Mixed Section A practice across the Paper 2 specification, usable as a full set or as a shorter diagnostic. Students will: - recognise which topic an unlabelled question is testing - trace an algorithm and record each step in a trace table - apply accurate knowledge to an unfamiliar context - work at about one minute per available mark - decide which topics to revisit from the feedback Inside: 3 explanation cells, 1 trace table, 2 multiple-choice questions, 2 fill-in-the-blanks cells and 6 written answers. 31 author-set marks plus the trace-table rows, about 60 minutes. Series: J277 Paper 2 · Exam transition, part 2 of 5.
WorksheetJ277 1 Paper 1 independent mini-assessment
Part 4 · J277 Paper 1 · Exam transition
A 40-mark independent mini-assessment sampling all six OCR J277 Paper 1 specification areas. Students will: - answer under independent, non-calculator conditions - show calculation and binary working in full - match the length of an answer to the marks available - move between systems, data, networks and impacts without prompts - use the feedback to target revision afterwards Inside: 7 explanation cells, 1 number grid, 4 multiple-choice questions and 10 written answers. 40 marks, about 60 minutes. Series: J277 Paper 1 · Exam transition, part 4 of 5.