Community
Revision
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.
- 440 resources
- 3 teachers sharing
- Creative Commons licensed
Revision
17 resources match. Newest first. Opening a resource shows the whole thing, with answers and marking held back.
Binary to Denary
WorksheetOCR H446 2.3.1 Algorithms consolidation
Part 15 · H446 2.3.1 · Algorithms
Everything in H446 2.3.1 meets here in one interleaved worksheet: representation, growth, searches, sorts, stacks, queues, linked lists, traversals and pathfinding, with no new content introduced. It is designed for the point in the course where students can each do the parts but choose the wrong method when the topic label is removed. Students will: - correct a cluster of common misstatements about growth and running time - sort the same list twice by different methods and give a case-sensitive point for each - trace a stack-like process and contrast it with circular queue and linked-list updates - set out traversal orders with their controlling structures and the effect of graph cycles - plan and justify algorithms for a four-part route planner with preconditions and tests Inside: 4 explanation cells, 1 multiple-choice question, 1 fill-in-the-blanks cell, 6 written answers and 1 trace table. 57 marks, about 60 to 80 minutes. Series: H446 2.3.1 · Algorithms, part 15 of 16.
WorksheetSeries · 2 partsH446 2.2.2 · Computational methods
Includes OCR H446 2.2.2 Computational Methods consolidation
Interleaved revision across the whole of H446 2.2.2, this worksheet deliberately mixes the methods so students have to recognise which one a problem calls for instead of practising each in turn. It runs from rapid retrieval through a backtracking trace and a coded heuristic to two extended evaluations, and introduces no new content. Students will: - match a described problem to the computational method at its centre - trace a backtracking search, then identify a dead end and the alternative explored next - implement a room-scoring heuristic with a defined tie rule - select and justify a different method for each of three needs in one scenario - evaluate combining a heuristic with a backtracking search on the same allocation problem Inside: 6 explanation cells, 2 multiple-choice questions, 2 fill-in-the-blanks cells, 3 written answers, 1 Python task and 1 trace table. 37 marks, about 40 to 60 minutes. Series: H446 2.2.2 · Computational methods, part 13 of 14.
WorksheetOCR H446 2.2.1 Programming techniques consolidation
Part 13 · H446 2.2.1 · Programming techniques
Consolidation across the whole of H446 2.2.1, built on a hack-day dashboard that mixes control flow, recursion, scope, parameter modes, debugging and object orientation. No new content is introduced, so the demand is selecting the right technique and supporting each explanation with evidence, with the planning support withdrawn as students work through it. Students will: - select an appropriate technique for a task and state a one-line plan for it - trace a recursive function and the value it returns - identify a range fault in a loop header, explain its effect and correct it - implement a class combining stored state, a calculation and a decision - justify an object-oriented design in which polymorphism produces type-specific output Inside: 4 explanation cells, 1 multiple-choice question, 3 written answers, 1 Python task and 1 trace table. 19 marks, about 40 to 55 minutes. Series: H446 2.2.1 · Programming techniques, part 13 of 14.
WorksheetOCR H446 2.1 Choosing and applying computational-thinking approaches
Part 2 · H446 2.1 · Elements of computational thinking
Before the assessment, students need to pick the right mode rather than recite five definitions. This consolidation worksheet for OCR H446 2.1 sorts problems by their central decision, repairs the misconceptions that cost the most marks, and applies all five modes to a council water-refill station app. Students will: - choose the computational-thinking mode that a problem's central decision calls for - correct common misconceptions about abstraction and about concurrent execution - map all five modes onto one system and explain a connection between two of them - trace a recommendation and explain why its result stays False - decide which tasks may overlap and what must hold before an update is published Inside: 6 explanation cells, 1 multiple-choice question, 2 fill-in-the-blanks cells, 4 written answers and 1 trace table. 36 marks, about 30 to 45 minutes. Series: H446 2.1 · Elements of computational thinking, part 2 of 2.
WorksheetOCR H446 1.4.2 Data Structures consolidation
Part 13 · H446 1.4.2 · Data structures
This is the mixed revision set for H446 1.4.2, so no new structures appear. Contexts are interleaved deliberately, which forces students to diagnose the behaviour a requirement needs before naming a structure, starting from a closed-book retrieval section and ending in an integrated game-server design. Students will: - recall structure choices from memory across contexts presented out of teaching order - diagnose the required behaviour, such as indexed shape or ordered removal, before choosing a structure - trace circular queue pointer updates and correct an unsafe linked-list insertion order - compare a directed graph with a tree, and a binary search tree with a hash table, for stated purposes - select and justify structures for six differing requirements in one game-server design Inside: 4 explanation cells, 2 multiple-choice questions, 1 fill-in-the-blanks cell, 5 written answers and 1 trace table. 35 marks, about 60 to 75 minutes. Series: H446 1.4.2 · Data structures, part 13 of 14.
WorksheetOCR H446 1.4.1 Data representation consolidation
Part 10 · H446 1.4.1 · Data types
No new content is introduced here: this is the consolidation piece that pulls the whole of H446 1.4.1 together. A live-event system mixing bookings, lighting values, signed sensor readings, audio, permission flags and messages means the questions never say which method to use, so students have to route to it themselves, starting from closed-book retrieval. Students will: - select the right representation method when the question does not name it - move between denary, 8-bit binary and hexadecimal in a mixed conversion table - interpret signed readings and complete fixed-width additions with the carry working shown - normalise and add values in the OCR floating-point format - read a shift or mask operation and state both the result and its purpose Inside: 4 explanation cells, 1 multiple-choice question, 1 fill-in-the-blanks cell, 2 written answers and 6 number answers. 42 marks, about 55 to 70 minutes. Series: H446 1.4.1 · Data types, part 10 of 11.
WorksheetOCR H446 1.3.3 Networks consolidation
Part 9 · H446 1.3.3 · Networks
Consolidation across H446 1.3.3, introducing no new content but requiring transfer, switching, threats, controls, hardware and service models to be used together. Students trace one inter-site request end to end, then redesign the same network after an incident report. Students will: - explain an inter-site request from domain name to usable data across all four layers - recommend a switching approach for two contrasting workloads on the same site - identify what is missing from an incomplete explanation of why layering helps - diagnose several threats from one incident report and design a layered response with limitations - select hardware roles and a service model for the redesigned network and justify both Inside: 5 explanation cells, 1 multiple-choice question, 1 fill-in-the-blanks cell and 4 written answers. 45 marks, about 45 to 60 minutes. Series: H446 1.3.3 · Networks, part 9 of 10.
WorksheetOCR H446 1.3.2 Databases consolidation
Part 12 · H446 1.3.2 · Databases
Every strand of H446 1.3.2 meets in one community-festival case here, from entity design and normalisation through SQL to indexing, integrity, transactions and data capture. No new specification content is introduced, so this works as a consolidation or revision session once the topic has been taught. Students will: - state the cardinalities in a supplied schema and explain how its keys support them - normalise the given design to third normal form and name the dependencies removed - write a multi-table query combining two conditions - write insertion and deletion statements for the same scenario - bring indexing, referential integrity, locking and capture methods to bear on a single case Inside: 4 explanation cells, 1 multiple-choice question, 1 fill-in-the-blanks cell and 7 written answers. 61 marks, about 70 to 85 minutes. Series: H446 1.3.2 · Databases, part 12 of 13.
WorksheetOCR H446 1.2.4 Programming Languages consolidation
Part 9 · H446 1.2.4 · Types of programming language
The consolidation piece for H446 1.2.4, bringing language choice, LMC execution, addressing modes and object-oriented design together in two running scenarios rather than revisiting each topic separately. No new content is introduced, so it suits a revision lesson or a checkpoint before assessment. Students will: - recommend and compare language levels for a portable application and a memory-constrained controller - trace one LMC execution that accepts several inputs and produces cumulative outputs - explain the output fault caused by removing a store instruction - resolve all four addressing modes against a single supplied memory state - write a class hierarchy that combines a validated capacity change with an overridden display method Inside: 5 explanation cells, 1 fill-in-the-blanks cell, 5 written answers and 1 trace table. 44 marks, about 55 to 70 minutes. Series: H446 1.2.4 · Types of programming language, part 9 of 10.
WorksheetOCR H446 1.2.2 Applications Generation mastery and transfer
Part 6 · H446 1.2.2 · Applications generation
Two extended development contexts pull the whole of H446 1.2.2 together here, covering software types, source models, translators, compilation stages and the library, linker and loader chain. No new content is introduced, so this belongs after the topic has been taught, at the point where students know the parts separately and need to combine them. Students will: - retrieve the topic's distinctions from memory before applying them in context - choose software and utilities for a mixed organisational brief and justify each from function - reach a conditional recommendation between a self-hosted open route and a managed closed one - trace one statement from tokens through to code placed in memory and running - weigh library benefits against drawbacks and repair a claim about reusing tested code Inside: 5 explanation cells, 2 multiple-choice questions, 2 fill-in-the-blanks cells and 5 written answers. 71 marks, about 50 to 65 minutes. Series: H446 1.2.2 · Applications generation, part 6 of 7.
WorksheetOCR H446 1.1.2 Types of processor consolidation
Part 4 · H446 1.1.2 · Types of processor
Two unfamiliar applied contexts, a mobile mapping platform and a flood simulation service, carry the consolidation of OCR H446 1.1.2. Students begin with closed-book retrieval and then apply CISC and RISC comparison, CPU and GPU choice and parallel allocation without returning to the worked examples. Students will: - reach a qualified processor recommendation for a low power terminal tied to legacy software - split a workflow between CPU, GPU and mixed processing according to workload shape - schedule a staged job on two cores and then on four - identify the serial stages and the storage bottleneck that cap a speed-up - repair claims that confuse parallel processing with pipelining or assume gain in proportion to cores Inside: 5 explanation cells, 2 multiple-choice questions, 1 fill-in-the-blanks cell and 4 written answers. 46 marks, about 55 to 70 minutes. Series: H446 1.1.2 · Types of processor, part 4 of 5.
WorksheetSeries · 2 partsH446 1.1.1 · Structure and function of the processor
Includes OCR H446 1.1.1 Processor structure and function consolidation
Everything in OCR H446 1.1.1 is interleaved here in one closed-book pass, from components and registers through buses and the fetch, decode and execute cycle to performance and architecture. It is built for use after the teaching sheets, with the explanation prompts used to repair answers rather than to prevent mistakes. Students will: - retrieve register, bus and component facts with no notes to hand - describe the purpose of all three buses in a single response - explain why a taken branch changes the program counter rather than the current instruction register - account for a core upgrade that barely improves a dependent single-threaded task - evaluate a change of architecture for a low-cost device that repeatedly processes a fixed sensor stream Inside: 2 explanation cells, 1 multiple-choice question, 1 fill-in-the-blanks cell and 7 written answers. 40 marks, about 45 to 60 minutes. Series: H446 1.1.1 · Structure and function of the processor, part 9 of 12.
WorksheetJ277 2.5 Programming languages and IDEs consolidation
Part 4 · J277 2.5 · Programming languages and IDEs
The consolidation worksheet for OCR J277 2.5, applied to a studio developing and releasing a Python game. Students will: - choose the language level a stated need calls for - select a translator and justify it against the studio's needs - read evidence from a development session and name the facility - structure an answer as point, mechanism and link - avoid generic lists in place of applied explanation Inside: 3 explanation cells, 1 multiple-choice question, 1 fill-in-the-blanks cell and 6 written answers. 38 marks, about 60 minutes. Series: J277 2.5 · Programming languages and IDEs, part 4 of 4.
WorksheetJ277 2.3 Producing robust programs consolidation
Part 7 · J277 2.3 · Producing robust programs
The consolidation worksheet for OCR J277 2.3, taking one festival booking system through validation, maintainability, testing and refinement. Students will: - implement a focused validation rule in Python - improve the maintainability of supplied code - find and refine a logic error - select test data for the stated rules - answer as feature, mechanism, then effect in this system Inside: 5 explanation cells, 2 runnable Python tasks, 1 multiple-choice question, 1 fill-in-the-blanks cell and 5 written answers. 34 marks, about 60 minutes. Series: J277 2.3 · Producing robust programs, part 7 of 7.
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 2.4 Boolean logic consolidation
Part 4 · J277 2.4 · Boolean logic
The consolidation worksheet for OCR J277 2.4, bringing gate rules, truth tables, combined expressions and diagrams together in one makerspace scenario. Students will: - translate a stated condition into a Boolean input - choose the operator a described rule needs - complete a truth table for a multi-stage expression - draw a diagram that meets a stated set of requirements - check that every input combination has been considered Inside: 3 explanation cells, 1 multiple-choice question, 1 fill-in-the-blanks cell and 6 written answers. 24 marks, about 45 minutes. Series: J277 2.4 · Boolean logic, part 4 of 4.