Diagram · Interactive model · Original practice
Fetch–decode–execute cycle
Trace instructions through CPU registers and buses, then practise written explanations.
Loading…
Loading…
Free learning resources
Choose your exam board and level, then pick the topic you want to practise. Explore clear explanations, worked examples and original questions with indicative answers.
51 matching resources in this collection.
Diagram · Interactive model · Original practice
Trace instructions through CPU registers and buses, then practise written explanations.
Diagram · Interactive model · Original practice
Understand keys, relationships and a simple database design.
Diagram · Interactive model · Original practice
Apply all six gates, Boolean laws and multi-stage circuits to exam-length questions.
Diagram · Interactive model · Original practice
Connect registers and buses to assembly, then explain clock speed, cache, cores and pipelining.
Diagram · Interactive model · Original practice
Compare RISC, CISC and GPUs; select input, output and storage for a stated problem.
Diagram · Interactive model · Original practice
Explain OS services, OS types, paging, segmentation, virtual memory, firmware, drivers and virtual machines.
Diagram · Interactive model · Original practice
Trace an ISR and compare all five OCR scheduling approaches with exact timelines.
Diagram · Interactive model · Original practice
Choose software and follow source code through compilation, linking and loading.
Diagram · Interactive model · Original practice
Choose waterfall, agile, XP, spiral or RAD and practise following/designing algorithms.
Diagram · Interactive model · Original practice
Choose programming approaches, trace Little Man Computer programs and resolve four addressing modes.
Diagram · Interactive model · Original practice
Follow a web request through DNS, TCP/IP and network hardware, then evaluate switching and security.
Diagram · Interactive model · Original practice
Build a small HTML/CSS/JavaScript page and reason about client/server processing, indexing and link ranking.
Diagram · Interactive model · Original practice
Choose the right operation, trace lossless compression and explain how keys and hashes are used.
Diagram · Interactive model · Original practice
Follow dependencies from a flat table to 3NF, query related records and reason about concurrent changes.
Diagram · Interactive model · Original practice
Keep bit width and representation explicit while converting, calculating, shifting and masking.
Diagram · Interactive model · Original practice
Decode signed mantissas, align exponents for arithmetic and separate Unicode characters from their byte encodings.
Diagram · Interactive model · Original practice
Choose a collection by what its positions mean, then create, traverse, insert and remove data safely.
Diagram · Interactive model · Original practice
Represent connections, traverse without revisiting vertices and handle collisions without losing keyed data.
Diagram · Interactive model · Original practice
Translate a rule into logic, simplify with named laws and group a four-variable map correctly across its edges.
Diagram · Interactive model · Original practice
Separate sum from carry and instantaneous combinational outputs from clocked stored state.
Diagram · Interactive model · Original practice
Apply data protection, computer misuse, copyright and investigatory powers to computing scenarios.
Diagram · Interactive model · Original practice
Evaluate automation, AI, privacy, censorship, the environment and inclusive design with balanced scenario answers.
Topic finder · Study route
Prepare for the AS recap topics, then explore linked lists and object-oriented Python.
Topic finder · Study route
Compare stacks and queues, then follow nodes and references in a linked list.
Diagram · Interactive model · Original practice
Follow nodes, references and traversal with a complete Python example from the workshop.
Diagram · Interactive model · Original practice
Understand attributes, methods, encapsulation and Python syntax in a standalone example.
Diagram · Interactive model · Original practice
Choose the details a model needs, break a problem into parts and practise explaining both methods.
Diagram · Interactive model · Original practice
Trace linear search, binary search and bubble sort with runnable Python and original questions.
Diagram · Interactive model · Original practice
Compare LIFO and FIFO, follow operations and check empty and full conditions.
Diagram · Interactive model · Original practice
Identify inputs, outputs and preconditions; weigh caching and reusable components.
Diagram · Interactive model · Original practice
Follow decision points and reason about tasks that can overlap.
Diagram · Interactive model · Original practice
Trace control structures, scope, parameters and modular programs; use debugging tools.
Diagram · Interactive model · Original practice
Choose methods for solvable problems, from divide and conquer to backtracking and modelling.
Diagram · Interactive model · Original practice
Trace calls and returns, identify a base case and compare recursion with iteration.
Diagram · Interactive model · Original practice
Compare time and space requirements and explain how growth affects algorithm choice.
Diagram · Interactive model · Original practice
Trace three sorting methods and compare their requirements and costs.
Diagram · Interactive model · Original practice
Build a binary search tree and trace depth-first post-order and breadth-first traversal.
Diagram · Interactive model · Original practice
Update tentative distances, reconstruct a shortest path and use a heuristic carefully.
Diagram · Interactive model · Original practice
Compare models with reality and design ordered subprocedures with clear inputs, outputs and assumptions.
Diagram · Interactive model · Original practice
Apply the remaining named computational methods with original basket-pattern calculations, performance predictions, pipeline schedules and visualisation choices.
Diagram · Interactive model · Original practice
Trace inheritance, overriding, super and a common method interface using an original runnable Python ticket example.
Diagram · Interactive model · Original practice
Create, traverse, search, insert into and delete from a singly linked list, including empty and head-node cases.
Diagram · Interactive model · Original practice
Implement stack and FIFO queue operations in fixed arrays with explicit empty/full rules, count and circular wraparound.
Diagram · Interactive model · Original practice
Design an original stock-reordering algorithm, trace a rounding bug, use debugger evidence and select useful test cases.
Diagram · Interactive model · Original practice
Trace a complete choose-check-recurse-undo search and compare exact search ordering with an approximate greedy rule.
Diagram · Interactive model · Original practice
Translate OCR string, file, loop and parameter conventions accurately into executable code.
Topic finder · Study route
Find OCR H446 topic guides, worked examples and original practice, organised by specification section.
Diagram · Interactive model · Original practice
Investigate a suitable problem, consult stakeholders and define justified, measurable success criteria.
OCR programming-project skills; develop your own assessed work under your centre's current rules.
Diagram · Interactive model · Original practice
Connect decomposition, algorithms, data structures, interfaces and test planning to analysed requirements.
OCR programming-project skills; develop your own assessed work under your centre's current rules.
Diagram · Interactive model · Original practice
Develop in justified increments and document tests, failures, fixes and retests as they happen.
OCR programming-project skills; develop your own assessed work under your centre's current rules.
Diagram · Interactive model · Original practice
Use final tests and feedback to judge success criteria, usability, limitations and justified future development.
OCR programming-project skills; develop your own assessed work under your centre's current rules.
Topic finder · Study route
Start with Python's data types and variables, then explore selection, loops, lists and functions.
Shared Python fundamentals; follow the representation and bounds stated in your question.
Diagram · Interactive model · Original practice
Recognise strings, integers, floats and Booleans, then trace assignments and user input.
Shared Python fundamentals; follow the representation and bounds stated in your question.
Diagram · Interactive model · Original practice
Use conditions to choose a branch and trace how for and while loops repeat instructions.
Shared Python fundamentals; follow the representation and bounds stated in your question.
Diagram · Interactive model · Original practice
Store related values in a Python list, then break a program into reusable functions.
Shared Python fundamentals; follow the representation and bounds stated in your question.
Diagram · Interactive model · Original practice
Draw gate symbols and simple circuits, then complete truth tables and GCSE practice.
OCR J277 requires AND, OR and NOT. Use the questions labelled for OCR.
Diagram · Interactive model · Original practice
Follow nodes, references and traversal with a complete Python example from the workshop.
Shared node and reference model, with construction and traversal practice.
Diagram · Interactive model · Original practice
Understand attributes, methods, encapsulation and Python syntax in a standalone example.
Shared Python classes, objects and methods; further AQA inheritance, composition and access-control requirements need additional study.
Diagram · Interactive model · Original practice
Choose the details a model needs, break a problem into parts and practise explaining both methods.
Shared modelling and decomposition foundation; AQA also examines further named forms of abstraction.
Diagram · Interactive model · Original practice
Trace linear search, binary search and bubble sort with runnable Python and original questions.
Shared linear search, binary search and bubble sort; AQA also requires merge sort.
Diagram · Interactive model · Original practice
Compare LIFO and FIFO, follow operations and check empty and full conditions.
Shared LIFO, FIFO and operation traces; AQA also requires priority queues and further implementation detail.
Diagram · Interactive model · Original practice
Trace control structures, scope, parameters and modular programs; use debugging tools.
Shared control structures, scope and subroutines; apply AQA's language and parameter conventions.
Diagram · Interactive model · Original practice
Trace calls and returns, identify a base case and compare recursion with iteration.
Shared call-stack and base-case reasoning; practise AQA's stack-frame requirements.
Diagram · Interactive model · Original practice
Compare time and space requirements and explain how growth affects algorithm choice.
Shared time/space growth and Big O; use the AQA computability guide for its further theory requirements.
Diagram · Interactive model · Original practice
Trace three sorting methods and compare their requirements and costs.
Use the merge-sort trace for AQA. Insertion and quick sort provide additional material.
Diagram · Interactive model · Original practice
Build a binary search tree and trace depth-first post-order and breadth-first traversal.
Shared pre-order, in-order and post-order rules; AQA also requires tree definitions and applications.
Diagram · Interactive model · Original practice
Update tentative distances, reconstruct a shortest path and use a heuristic carefully.
Use the Dijkstra trace for AQA. A* is additional material; graph breadth-first/depth-first traversal needs separate practice.
Diagram · Interactive model · Original practice
Compare models with reality and design ordered subprocedures with clear inputs, outputs and assumptions.
Shared models, decomposition and procedure contracts; AQA's wider abstraction taxonomy needs additional study.
Diagram · Interactive model · Original practice
Trace inheritance, overriding, super and a common method interface using an original runnable Python ticket example.
Shared inheritance and method overriding; AQA also requires UML, composition and language-specific access control.
Diagram · Interactive model · Original practice
Create, traverse, search, insert into and delete from a singly linked list, including empty and head-node cases.
Shared construction, traversal, insertion and deletion; use the representation stated by an AQA question.
Diagram · Interactive model · Original practice
Implement stack and FIFO queue operations in fixed arrays with explicit empty/full rules, count and circular wraparound.
Shared capacity checks and pointer traces; AQA also requires priority queues.
Diagram · Interactive model · Original practice
Design an original stock-reordering algorithm, trace a rounding bug, use debugger evidence and select useful test cases.
Shared design, tracing, test data and debugging; practise adapting unfamiliar programs for AQA's on-screen paper.
Diagram · Interactive model · Original practice
Choose a collection by what its positions mean, then create, traverse, insert and remove data safely.
Shared indexed collections and records; AQA's vector mathematics and file requirements need further resources.
Diagram · Interactive model · Original practice
Represent connections, traverse without revisiting vertices and handle collisions without losing keyed data.
Shared graph representations and collision handling; add AQA graph-traversal and dictionary practice.
Diagram · Interactive model · Original practice
Choose waterfall, agile, XP, spiral or RAD and practise following/designing algorithms.
Shared development and testing concepts; AQA's systematic problem-solving terminology governs exam answers.
Diagram · Interactive model · Original practice
Trace accepting FSMs and Mealy outputs, interpret the required set mathematics, translate simple regexes and use BNF/syntax diagrams.
AQA-specific topic and original practice for 7517.
Diagram · Interactive model · Original practice
Trace a one-way infinite-tape machine, interpret transition rules, compare growth and distinguish tractability from non-computability.
AQA-specific topic and original practice for 7517.
Diagram · Interactive model · Original practice
Compare FIFO and priority service, trace stable ties, and apply full/empty checks without confusing the ADT with its implementation.
AQA-specific topic and original practice for 7517.
Diagram · Interactive model · Original practice
Create and update key/value mappings, retrieve missing keys safely, and trace an original word-frequency program with explicit token rules.
AQA-specific topic and original practice for 7517.
Diagram · Interactive model · Original practice
Connect lists, dictionaries, functions and geometric vectors; calculate addition, scaling, convex combinations and angles.
AQA-specific topic and original practice for 7517.
Diagram · Interactive model · Original practice
Connect infix notation, expression trees and RPN; trace non-commutative operators and detect malformed expressions.
AQA-specific topic and original practice for 7517.
Diagram · Interactive model · Original practice
Use an original score-report starter, real text fixtures and independent tests to practise adapting an unfamiliar Python program.
AQA-specific topic and original practice for 7517.
Diagram · Interactive model · Original practice
Trace instructions through CPU registers and buses, then practise written explanations.
Includes MBR terminology used by AQA and an AQA-labelled practice question.
Diagram · Interactive model · Original practice
Understand keys, relationships and a simple database design.
Shared keys and relationships with AQA entity-modelling practice; further normalisation and SQL requirements need additional study.
Diagram · Interactive model · Original practice
Apply all six gates, Boolean laws and multi-stage circuits to exam-length questions.
Use the AQA-labelled circuit and Boolean-simplification questions.
Diagram · Interactive model · Original practice
Connect registers and buses to assembly, then explain clock speed, cache, cores and pipelining.
Shared stored-program, register and performance ideas; use AQA's MBR terminology and required register set.
Diagram · Interactive model · Original practice
Compare RISC, CISC and GPUs; select input, output and storage for a stated problem.
Shared processor and storage concepts; AQA also requires operating principles of its named external devices.
Diagram · Interactive model · Original practice
Explain OS services, OS types, paging, segmentation, virtual memory, firmware, drivers and virtual machines.
Shared OS resource-management and memory concepts; check AQA's required depth.
Diagram · Interactive model · Original practice
Trace an ISR and compare all five OCR scheduling approaches with exact timelines.
Shared interrupt and saved-state reasoning; OCR scheduling algorithms are additional material.
Diagram · Interactive model · Original practice
Choose software and follow source code through compilation, linking and loading.
Shared software and translation concepts; AQA also requires intermediate-language and bytecode execution.
Diagram · Interactive model · Original practice
Choose the right operation, trace lossless compression and explain how keys and hashes are used.
Shared compression and encryption foundations; AQA also requires Caesar and Vernam/one-time-pad traces.
Diagram · Interactive model · Original practice
Follow dependencies from a flat table to 3NF, query related records and reason about concurrent changes.
Shared 1NF–3NF and SQL foundations; AQA's concurrency methods and exact command scope need further study.
Diagram · Interactive model · Original practice
Follow a web request through DNS, TCP/IP and network hardware, then evaluate switching and security.
Shared network and protocol foundations; AQA also requires subnetting, wireless communication and addressing detail.
Diagram · Interactive model · Original practice
Build a small HTML/CSS/JavaScript page and reason about client/server processing, indexing and link ranking.
Shared client/server and web foundations; AQA also requires WebSocket, REST/CRUD and JSON/XML comparisons.
Diagram · Interactive model · Original practice
Keep bit width and representation explicit while converting, calculating, shifting and masking.
Shared base conversion and two's-complement arithmetic; OCR sign-and-magnitude comparisons are additional material.
Diagram · Interactive model · Original practice
Decode signed mantissas, align exponents for arithmetic and separate Unicode characters from their byte encodings.
Shared representation foundations; AQA's error calculations, coding and multimedia scope need additional study.
Diagram · Interactive model · Original practice
Translate a rule into logic, simplify with named laws and group a four-variable map correctly across its edges.
Shared Boolean identities and De Morgan laws; Karnaugh-map practice provides additional material for AQA.
Diagram · Interactive model · Original practice
Separate sum from carry and instantaneous combinational outputs from clocked stored state.
Shared half/full adders and edge-triggered D-type behaviour; follow AQA's symbol conventions.
Diagram · Interactive model · Original practice
Apply data protection, computer misuse, copyright and investigatory powers to computing scenarios.
Shared legal-issue reasoning; OCR's named-statute list does not define AQA's full legal and social scope.
Diagram · Interactive model · Original practice
Evaluate automation, AI, privacy, censorship, the environment and inclusive design with balanced scenario answers.
Shared balanced evaluation; AQA also emphasises embedded values, developer responsibilities and worldwide effects.
Diagram · Interactive model · Original practice
Apply the remaining named computational methods with original basket-pattern calculations, performance predictions, pipeline schedules and visualisation choices.
Shared data-mining foundation; AQA Big Data also requires distributed processing and further representation concepts.
Diagram · Interactive model · Original practice
Apply AQA function types, first-class functions, partial application, composition, map, filter, fold and head/tail list operations.
AQA-specific topic and original practice for 7517.
Diagram · Interactive model · Original practice
Paint a bitmap, calculate its payload and header, and compare scalable vector drawing instructions with sampled pixels.
AQA-specific topic and original practice for 7517.
Diagram · Interactive model · Original practice
Explore time samples and amplitude codes, calculate PCM storage, and distinguish audio recordings from MIDI performance events.
AQA-specific topic and original practice for 7517.
Diagram · Interactive model · Original practice
Compute network identifiers, choose local versus gateway delivery, follow a DHCP lease, and distinguish outbound NAT from inbound forwarding.
AQA-specific topic and original practice for 7517.
Diagram · Interactive model · Original practice
Choose programming approaches, trace Little Man Computer programs and resolve four addressing modes.
Procedural/OOP foundations support Paper 1; language classification supports Paper 2. OCR LMC does not replace AQA assembly notation.
Topic finder · Study route
Start with Python's data types and variables, then explore selection, loops, lists and functions.
Shared Python fundamentals; use AQA's terminology and response format for exam answers.
Diagram · Interactive model · Original practice
Recognise strings, integers, floats and Booleans, then trace assignments and user input.
Shared Python fundamentals; use AQA's terminology and response format for exam answers.
Diagram · Interactive model · Original practice
Use conditions to choose a branch and trace how for and while loops repeat instructions.
Shared Python fundamentals; use AQA's terminology and response format for exam answers.
Diagram · Interactive model · Original practice
Store related values in a Python list, then break a program into reusable functions.
Shared Python fundamentals; use AQA's terminology and response format for exam answers.
Diagram · Interactive model · Original practice
Draw gate symbols and simple circuits, then complete truth tables and GCSE practice.
AQA 8525 requires AND, OR, NOT and XOR. Use the questions labelled for AQA.
Diagram · Interactive model · Original practice
Trace instructions through CPU registers and buses, then practise written explanations.
Includes Cambridge register-transfer notation and interrupt practice. Check your examination-year syllabus.
Diagram · Interactive model · Original practice
Understand keys, relationships and a simple database design.
Shared keys, relationships and a Cambridge-labelled 3NF question; further DBMS and SQL requirements need additional study.
Diagram · Interactive model · Original practice
Apply all six gates, Boolean laws and multi-stage circuits to exam-length questions.
Use the Cambridge-labelled circuits and truth tables; check AS and advanced Boolean requirements for your course.
Diagram · Interactive model · Original practice
Follow nodes, references and traversal with a complete Python example from the workshop.
Construction and traversal foundation; Cambridge A-Level also requires insertion and deletion practice.
Diagram · Interactive model · Original practice
Understand attributes, methods, encapsulation and Python syntax in a standalone example.
Shared Python classes and methods; Cambridge also requires further inheritance, containment and polymorphism practice.
Diagram · Interactive model · Original practice
Choose the details a model needs, break a problem into parts and practise explaining both methods.
Shared problem-solving concepts; Cambridge pseudocode uses its own declarations, assignment and index bounds.
Diagram · Interactive model · Original practice
Trace linear search, binary search and bubble sort with runnable Python and original questions.
Shared search and bubble-sort rules; Cambridge also requires insertion-sort practice at A Level.
Diagram · Interactive model · Original practice
Compare LIFO and FIFO, follow operations and check empty and full conditions.
Shared ADT operations; Cambridge requires different implementation depth at AS and A Level.
Diagram · Interactive model · Original practice
Trace control structures, scope, parameters and modular programs; use debugging tools.
Shared programming constructs and scope; Cambridge's pseudocode, BYREF/BYVAL and parameter conventions differ.
Diagram · Interactive model · Original practice
Trace calls and returns, identify a base case and compare recursion with iteration.
Shared call-stack, termination and unwinding; supports Cambridge A-Level section 19.
Diagram · Interactive model · Original practice
Compare time and space requirements and explain how growth affects algorithm choice.
Shared time and space Big O; supports Cambridge's advanced algorithm comparisons.
Diagram · Interactive model · Original practice
Trace three sorting methods and compare their requirements and costs.
Use insertion sort for Cambridge A Level. Merge and quick sort are additional material.
Diagram · Interactive model · Original practice
Build a binary search tree and trace depth-first post-order and breadth-first traversal.
Shared binary-tree operations; Cambridge's required finding and insertion tasks need independent practice.
Diagram · Interactive model · Original practice
Update tentative distances, reconstruct a shortest path and use a heuristic carefully.
Shared Dijkstra and A* traces for advanced AI; Cambridge does not require graph-search implementation code here.
Diagram · Interactive model · Original practice
Compare models with reality and design ordered subprocedures with clear inputs, outputs and assumptions.
Shared problem models and procedural design; Cambridge identifier tables and stepwise refinement need further practice.
Diagram · Interactive model · Original practice
Trace inheritance, overriding, super and a common method interface using an original runnable Python ticket example.
Shared OOP inheritance and overriding; Cambridge also requires containment, aggregation and independent class design.
Diagram · Interactive model · Original practice
Create, traverse, search, insert into and delete from a singly linked list, including empty and head-node cases.
Shared linked-list operations; AS and advanced A-Level implementation requirements differ.
Diagram · Interactive model · Original practice
Implement stack and FIFO queue operations in fixed arrays with explicit empty/full rules, count and circular wraparound.
Shared ADT operations and fixed-array traces; Cambridge requires greater implementation depth at A Level than AS.
Diagram · Interactive model · Original practice
Design an original stock-reordering algorithm, trace a rounding bug, use debugger evidence and select useful test cases.
Shared algorithm design, testing and debugging; use Cambridge's pseudocode and representation conventions.
Diagram · Interactive model · Original practice
Choose a collection by what its positions mean, then create, traverse, insert and remove data safely.
Shared arrays and records; Cambridge declarations, explicit bounds, DATE and user-defined types need further study.
Diagram · Interactive model · Original practice
Represent connections, traverse without revisiting vertices and handle collisions without losing keyed data.
Shared graph/ADT and hashing concepts; graph implementation code is additional material for Cambridge.
Diagram · Interactive model · Original practice
Connect registers and buses to assembly, then explain clock speed, cache, cores and pipelining.
Shared register, bus and processor concepts; Cambridge uses its own register-transfer and assembly conventions.
Diagram · Interactive model · Original practice
Compare RISC, CISC and GPUs; select input, output and storage for a stated problem.
Shared processors, I/O and storage; Cambridge's parallel-processing classifications and device detail need further study.
Diagram · Interactive model · Original practice
Explain OS services, OS types, paging, segmentation, virtual memory, firmware, drivers and virtual machines.
Shared OS, paging and virtual-machine concepts; Cambridge's advanced memory-management requirements need further practice.
Diagram · Interactive model · Original practice
Trace an ISR and compare all five OCR scheduling approaches with exact timelines.
Shared interrupts and FCFS/RR/SJF/SRT scheduling; MLFQ is additional OCR material. Cambridge also requires process-state reasoning.
Diagram · Interactive model · Original practice
Choose software and follow source code through compilation, linking and loading.
Shared translator stages and software concepts; Cambridge also requires BNF/syntax diagrams and reverse Polish notation.
Diagram · Interactive model · Original practice
Choose waterfall, agile, XP, spiral or RAD and practise following/designing algorithms.
Shared development and testing foundations; Cambridge names waterfall, iterative and RAD, plus its own maintenance/testing methods.
Diagram · Interactive model · Original practice
Choose programming approaches, trace Little Man Computer programs and resolve four addressing modes.
Shared paradigms and addressing concepts; OCR LMC does not replace Cambridge assembly/declarative tasks or Paper 4 conventions.
Diagram · Interactive model · Original practice
Choose the right operation, trace lossless compression and explain how keys and hashes are used.
Shared compression and encryption foundations; Cambridge also requires certificates, signatures and quantum-cryptography concepts.
Diagram · Interactive model · Original practice
Follow dependencies from a flat table to 3NF, query related records and reason about concurrent changes.
Shared normalisation and SQL; Cambridge's DBMS features and full DDL/DML command list need further practice.
Diagram · Interactive model · Original practice
Follow a web request through DNS, TCP/IP and network hardware, then evaluate switching and security.
Shared network layers and switching; Cambridge's named communication protocols and full message paths need further practice.
Diagram · Interactive model · Original practice
Keep bit width and representation explicit while converting, calculating, shifting and masking.
Shared base conversion and integer arithmetic; use Cambridge's stated widths and signed representation conventions.
Diagram · Interactive model · Original practice
Decode signed mantissas, align exponents for arithmetic and separate Unicode characters from their byte encodings.
Shared encoding and floating-point foundations; Cambridge's advanced mantissa/exponent formats and errors need independent practice.
Diagram · Interactive model · Original practice
Translate a rule into logic, simplify with named laws and group a four-variable map correctly across its edges.
Shared simplification and Karnaugh maps; check Cambridge's AS and advanced Boolean requirements.
Diagram · Interactive model · Original practice
Separate sum from carry and instantaneous combinational outputs from clocked stored state.
Shared adder logic. This guide's D-type flip-flops do not cover Cambridge's required SR and JK flip-flops.
Diagram · Interactive model · Original practice
Apply data protection, computer misuse, copyright and investigatory powers to computing scenarios.
Use the legal-issue reasoning as a foundation; OCR's UK statute list is additional material for Cambridge.
Diagram · Interactive model · Original practice
Evaluate automation, AI, privacy, censorship, the environment and inclusive design with balanced scenario answers.
Shared ethical evaluation; Cambridge's professional duties, licensing and ownership requirements need further study.
Diagram · Interactive model · Original practice
Read, append and update records; distinguish file organisation/access and handle specific failures.
Cambridge-specific explanations and original practice for the 2027–2029 syllabus; check your examination year.
Diagram · Interactive model · Original practice
Work with parity, block parity, checksums and check digits, then distinguish detection from retransmission.
Cambridge-specific explanations and original practice for the 2027–2029 syllabus; check your examination year.
Diagram · Interactive model · Original practice
Compare supervised, unsupervised, reinforcement and deep learning, with regression and error-update examples.
Cambridge-specific explanations and original practice for the 2027–2029 syllabus; check your examination year.
Diagram · Interactive model · Original practice
Paint a bitmap, calculate its payload and header, and compare scalable vector drawing instructions with sampled pixels.
Cambridge-specific explanations and original practice for the 2027–2029 syllabus; check your examination year.
Diagram · Interactive model · Original practice
Explore time samples and amplitude codes, calculate PCM storage, and distinguish audio recordings from MIDI performance events.
Cambridge-specific explanations and original practice for the 2027–2029 syllabus; check your examination year.
Diagram · Interactive model · Original practice
Connect infix notation, expression trees and RPN; trace non-commutative operators and detect malformed expressions.
Cambridge-specific explanations and original practice for the 2027–2029 syllabus; check your examination year.
Diagram · Interactive model · Original practice
Compute network identifiers, choose local versus gateway delivery, follow a DHCP lease, and distinguish outbound NAT from inbound forwarding.
Cambridge-specific explanations and original practice for the 2027–2029 syllabus; check your examination year.
Diagram · Interactive model · Original practice
Apply an active-high NOR SR latch and an explicitly rising-edge JK model, with connected feedback circuits and retained state.
Cambridge-specific explanations and original practice for the 2027–2029 syllabus; check your examination year.
Diagram · Interactive model · Original practice
Construct and debug a text-loaded record store with collision probing, updates, save/reload and explicit test evidence.
Cambridge-specific explanations and original practice for the 2027–2029 syllabus; check your examination year.
Topic finder · Study route
Start with Python's data types and variables, then explore selection, loops, lists and functions.
Shared Python fundamentals; Cambridge pseudocode uses its own declarations and array bounds.
Diagram · Interactive model · Original practice
Recognise strings, integers, floats and Booleans, then trace assignments and user input.
Shared Python fundamentals; Cambridge pseudocode uses its own declarations and array bounds.
Diagram · Interactive model · Original practice
Use conditions to choose a branch and trace how for and while loops repeat instructions.
Shared Python fundamentals; Cambridge pseudocode uses its own declarations and array bounds.
Diagram · Interactive model · Original practice
Store related values in a Python list, then break a program into reusable functions.
Shared Python fundamentals; Cambridge pseudocode uses its own declarations and array bounds.
Diagram · Interactive model · Original practice
Draw gate symbols and simple circuits, then complete truth tables and GCSE practice.
Cambridge IGCSE 0478 requires all six gates. Use the questions labelled for Cambridge and check your syllabus year.
The library grows as resources are checked for accuracy, accessibility and usefulness. You can suggest a topic without creating an account.
Suggest a learning resourceUse the free resources first, then explore tuition if one-to-one support would add something useful.