SubjectScout
ENAR
Sign inGet matched
Get matched

Computer Science: Cambridge 2027 syllabus mapping

Cambridge International AS & A Level 9618 · Examination year 2027

AI-assisted conceptual placements, not official Cambridge endorsement or independent teacher approval. A linked practice question does not establish complete teaching, practical competence or exam readiness.

Current question placements
126 / 151
Direct conceptual matches
97
Partial matches
21
Enrichment
8
Placements needing review
0
Inventory entries without linked practice
47

Inventory scope: specified content sections. Source inventory: recorded in full at this scope. Independent teacher approval: pending.

Official references

Practice by syllabus reference

AS · Core (144 entries)
Computer Science 9618: AS · Core
ReferenceConceptLinked practice
1.1 Data Representation / Candidates should be able to / objective row 1Binary versus decimal storage prefixes: kibi through tebi
1.1 Data Representation / Candidates should be able to / objective row 2Integer conversions: binary, denary, hexadecimal, BCD and complements
1.1 Data Representation / Candidates should be able to / objective row 3Signed binary addition, subtraction and overflow
1.1 Data Representation / Candidates should be able to / objective row 4Practical uses of BCD and hexadecimalNo linked practice
1.1 Data Representation / Candidates should be able to / objective row 5Character encoding with ASCII, extended ASCII and Unicode
1.2 Multimedia / Candidates should be able to / objective row 1Bitmap encoding: pixels, headers, resolution and colour depth
1.2 Multimedia / Candidates should be able to / objective row 2Bitmap storage estimates
1.2 Multimedia / Candidates should be able to / objective row 3Bitmap quality and size trade-offs
1.2 Multimedia / Candidates should be able to / objective row 4Vector objects, properties and drawing listsNo linked practice
1.2 Multimedia / Candidates should be able to / objective row 5Choose bitmap or vector for a purposeNo linked practice
1.2 Multimedia / Candidates should be able to / objective row 6Digitise sound using sampling and resolution
1.2 Multimedia / Candidates should be able to / objective row 7Sampling choices affect storage and accuracy
1.3 Compression / Candidates should be able to / objective row 1Reasons and contexts for compression
1.3 Compression / Candidates should be able to / objective row 2Choose lossy or lossless compression
1.3 Compression / Candidates should be able to / objective row 3Compress text, images and sound, including RLENo linked practice
2.1 Networks including the internet / Candidates should be able to / objective row 1Purposes and benefits of networking
2.1 Networks including the internet / Candidates should be able to / objective row 2LAN and WAN characteristics
2.1 Networks including the internet / Candidates should be able to / objective row 3Client-server versus peer-to-peer roles and trade-offsNo linked practice
2.1 Networks including the internet / Candidates should be able to / objective row 4Thin versus thick clients
2.1 Networks including the internet / Candidates should be able to / objective row 5Bus, star, mesh and hybrid topology choicesNo linked practice
2.1 Networks including the internet / Candidates should be able to / objective row 6Public/private cloud benefits and costsNo linked practice
2.1 Networks including the internet / Candidates should be able to / objective row 7Wired/wireless media including fibre, radio, microwave and satellite
2.1 Networks including the internet / Candidates should be able to / objective row 8LAN hardware including switch, NIC, WNIC, WAP, bridge and repeater
2.1 Networks including the internet / Candidates should be able to / objective row 9Router functions between networks
2.1 Networks including the internet / Candidates should be able to / objective row 10Ethernet collision handling and CSMA/CD
2.1 Networks including the internet / Candidates should be able to / objective row 11Real-time/on-demand streaming and bit-rate requirements
2.1 Networks including the internet / Candidates should be able to / objective row 12Distinguish WWW from internet
2.1 Networks including the internet / Candidates should be able to / objective row 13Internet access hardware, modems, PSTN and mobile links
2.1 Networks including the internet / Candidates should be able to / objective row 14IPv4/IPv6, subnetting, device addressing, public/private and static/dynamic addressesNo linked practice
2.1 Networks including the internet / Candidates should be able to / objective row 15URL resource location and DNS resolution
3.1 Computers and their components / Candidates should be able to / objective row 1Input/output, primary memory and persistent storage needs
3.1 Computers and their components / Candidates should be able to / objective row 2Embedded-system benefits and limitations
3.1 Computers and their components / Candidates should be able to / objective row 3Device operation: printers, audio, disks, flash, optical, touch and VR
3.1 Computers and their components / Candidates should be able to / objective row 4Buffer purposes
3.1 Computers and their components / Candidates should be able to / objective row 5RAM versus ROM and use cases
3.1 Computers and their components / Candidates should be able to / objective row 6SRAM versus DRAM and appropriate uses
3.1 Computers and their components / Candidates should be able to / objective row 7PROM, EPROM and EEPROM differences
3.1 Computers and their components / Candidates should be able to / objective row 8Monitoring/control, sensors, actuators and feedback
3.2 Logic Gates and Logic Circuits / Candidates should be able to / objective row 1Recognise six standard gate symbolsNo linked practice
3.2 Logic Gates and Logic Circuits / Candidates should be able to / objective row 2Functions of NOT, AND, OR, NAND, NOR and XOR
3.2 Logic Gates and Logic Circuits / Candidates should be able to / objective row 3Individual gate truth tables
3.2 Logic Gates and Logic Circuits / Candidates should be able to / objective row 4Construct circuit from statement, expression or table
3.2 Logic Gates and Logic Circuits / Candidates should be able to / objective row 5Construct truth table from statement, circuit or expressionNo linked practice
3.2 Logic Gates and Logic Circuits / Candidates should be able to / objective row 6Construct expression from statement, circuit or table
4.1 Central Processing Unit (CPU) Architecture / Candidates should be able to / objective row 1Stored-program Von Neumann model
4.1 Central Processing Unit (CPU) Architecture / Candidates should be able to / objective row 2General/special registers: PC, MDR, MAR, ACC, IX, CIR, status
4.1 Central Processing Unit (CPU) Architecture / Candidates should be able to / objective row 3ALU, control unit, clock and immediate access store
4.1 Central Processing Unit (CPU) Architecture / Candidates should be able to / objective row 4Address, data and control bus transfers
4.1 Central Processing Unit (CPU) Architecture / Candidates should be able to / objective row 5Performance: cores, bus width, clock and cache
4.1 Central Processing Unit (CPU) Architecture / Candidates should be able to / objective row 6USB, HDMI and VGA peripheral connections
4.1 Central Processing Unit (CPU) Architecture / Candidates should be able to / objective row 7Fetch-execute stages and register transfers
4.1 Central Processing Unit (CPU) Architecture / Candidates should be able to / objective row 8Interrupt causes, detection, ISR and state handling
4.2 Assembly Language / Candidates should be able to / objective row 1Machine code and assembly relationship
4.2 Assembly Language / Candidates should be able to / objective row 2Two-pass assembly and symbol resolution
4.2 Assembly Language / Candidates should be able to / objective row 3Trace simple assembly programsNo linked practice
4.2 Assembly Language / Candidates should be able to / objective row 4Instruction categories: movement, I/O, arithmetic, branches and comparison
4.2 Assembly Language / Candidates should be able to / objective row 5Immediate, direct, indirect, indexed and relative addressing
4.3 Bit manipulation / Candidates should be able to / objective row 1Logical, arithmetic and cyclic shifts in both directions
4.3 Bit manipulation / Candidates should be able to / objective row 2Device monitoring/control with bit masks and bit testsNo linked practice
5.1 Operating Systems / Candidates should be able to / objective row 1Why operating systems are needed
5.1 Operating Systems / Candidates should be able to / objective row 2Memory, files, security, devices and process management
5.1 Operating Systems / Candidates should be able to / objective row 3Utility software: formatting, malware checks, repair, compression and backup
5.1 Operating Systems / Candidates should be able to / objective row 4Reusable program libraries including DLL benefits
5.2 Language Translators / Candidates should be able to / objective row 1Need for assembler, compiler and interpreter
5.2 Language Translators / Candidates should be able to / objective row 2Choose compiler or interpreter with trade-offs
5.2 Language Translators / Candidates should be able to / objective row 3Hybrid translation/execution such as Java
5.2 Language Translators / Candidates should be able to / objective row 4IDE coding, syntax, formatting and debugging facilities
6.1 Data Security / Candidates should be able to / objective row 1Distinguish security, privacy and integrity
6.1 Data Security / Candidates should be able to / objective row 2Need to protect systems as well as data
6.1 Data Security / Candidates should be able to / objective row 3System safeguards: accounts, passwords, authentication, malware controls and encryption
6.1 Data Security / Candidates should be able to / objective row 4Network threats: malware, hackers, phishing and pharming
6.1 Data Security / Candidates should be able to / objective row 5Methods reducing identified threats
6.1 Data Security / Candidates should be able to / objective row 6Data protection with encryption and access rights
6.2 Data Integrity / Candidates should be able to / objective row 1Validation and verification protect integrity differently
6.2 Data Integrity / Candidates should be able to / objective row 2Range, format, length, presence, existence, limit and check-digit validation
6.2 Data Integrity / Candidates should be able to / objective row 3Visual/double-entry verification; parity and checksums on transfer
7.1 Ethics and Ownership / Candidates should be able to / objective row 1Professional ethics and bodies such as BCS/IEEE
7.1 Ethics and Ownership / Candidates should be able to / objective row 2Consequences of ethical/unethical choices
7.1 Ethics and Ownership / Candidates should be able to / objective row 3Purpose of copyright law
7.1 Ethics and Ownership / Candidates should be able to / objective row 4Choose free/open-source, shareware or commercial licensing
7.1 Ethics and Ownership / Candidates should be able to / objective row 5AI applications and social, economic and environmental impacts
8.1 Database Concepts / Candidates should be able to / objective row 1File-based data limitations
8.1 Database Concepts / Candidates should be able to / objective row 2Relational features addressing file-based limitations
8.1 Database Concepts / Candidates should be able to / objective row 3Entities, keys, relationships, integrity and indexing terminology
8.1 Database Concepts / Candidates should be able to / objective row 4Entity-relationship design diagramsNo linked practice
8.1 Database Concepts / Candidates should be able to / objective row 5Normalisation through 1NF, 2NF and 3NF
8.1 Database Concepts / Candidates should be able to / objective row 6Judge whether tables satisfy 3NFNo linked practice
8.1 Database Concepts / Candidates should be able to / objective row 7Construct a normalised relational design
8.2 Database Management Systems (DBMS) / Candidates should be able to / objective row 1DBMS dictionary, modelling, schema, integrity, access and backup
8.2 Database Management Systems (DBMS) / Candidates should be able to / objective row 2Developer interface and query processor use
8.3 Data Definition Language (DDL) and Data Manipulation Language (DML) / Candidates should be able to / objective row 1DDL manages database structure
8.3 Data Definition Language (DDL) and Data Manipulation Language (DML) / Candidates should be able to / objective row 2DML retrieves and maintains data
8.3 Data Definition Language (DDL) and Data Manipulation Language (DML) / Candidates should be able to / objective row 3SQL is a standard for both DDL and DML
8.3 Data Definition Language (DDL) and Data Manipulation Language (DML) / Candidates should be able to / objective row 4SQL database/table creation, supported field types, ALTER, primary/foreign keysNo linked practice
8.3 Data Definition Language (DDL) and Data Manipulation Language (DML) / Candidates should be able to / objective row 5SQL over at most two tables: SELECT, WHERE, ordering, grouping, INNER JOIN, aggregates, INSERT, DELETE and UPDATE
9.1 Computational Thinking Skills / Candidates should be able to / objective row 1Purpose and construction of abstractions
9.1 Computational Thinking Skills / Candidates should be able to / objective row 2Decomposition into modules and subproblems
9.2 Algorithms / Candidates should be able to / objective row 1Algorithms as defined solution steps
9.2 Algorithms / Candidates should be able to / objective row 2Meaningful identifiers and identifier tables
9.2 Algorithms / Candidates should be able to / objective row 3Pseudocode for input, processing and outputNo linked practice
9.2 Algorithms / Candidates should be able to / objective row 4Sequence, selection and iteration pseudocode
9.2 Algorithms / Candidates should be able to / objective row 5Document algorithms with structured English, flowcharts or pseudocode
9.2 Algorithms / Candidates should be able to / objective row 6Translate descriptions/flowcharts into pseudocode
9.2 Algorithms / Candidates should be able to / objective row 7Translate descriptions/pseudocode into flowcharts
9.2 Algorithms / Candidates should be able to / objective row 8Stepwise refinement into programmable detail
9.2 Algorithms / Candidates should be able to / objective row 9Logic statements within algorithms
10.1 Data Types and Records / Candidates should be able to / objective row 1Choose suitable scalar and structured types
10.1 Data Types and Records / Candidates should be able to / objective row 2Define, read and update mixed-type recordsNo linked practice
10.2 Arrays / Candidates should be able to / objective row 1Indices and explicit lower/upper bounds
10.2 Arrays / Candidates should be able to / objective row 2Choose one- or two-dimensional arrayNo linked practice
10.2 Arrays / Candidates should be able to / objective row 3Declare and use 1D/2D arrays in pseudocode
10.2 Arrays / Candidates should be able to / objective row 4Process arrays using bubble sort and linear search
10.3 Files / Candidates should be able to / objective row 1Reasons for persistent files
10.3 Files / Candidates should be able to / objective row 2Handle line-oriented text files in pseudocode
10.4 Introduction to Abstract Data Types (ADT) / Candidates should be able to / objective row 1ADTs combine data with operations
10.4 Introduction to Abstract Data Types (ADT) / Candidates should be able to / objective row 2Stack, queue and linked-list features and use cases
10.4 Introduction to Abstract Data Types (ADT) / Candidates should be able to / objective row 3Store, add, edit and delete ADT data without required AS pseudocode
10.4 Introduction to Abstract Data Types (ADT) / Candidates should be able to / objective row 4Array implementations of stacks, queues and linked listsNo linked practice
11.1 Programming Basics / Candidates should be able to / objective row 1Implement design from flowchart or structured English
11.1 Programming Basics / Candidates should be able to / objective row 2Declare/initialise constants and variables; assign, calculate and perform console I/O
11.1 Programming Basics / Candidates should be able to / objective row 3Use built-in/library routines with supplied unfamiliar/string functions
11.2 Constructs / Candidates should be able to / objective row 1Write nested IF/ELSE, CASE, FOR, REPEAT and WHILE constructs
11.2 Constructs / Candidates should be able to / objective row 2Justify choice of loop structureNo linked practice
11.3 Structured Programming / Candidates should be able to / objective row 1Define and use procedures
11.3 Structured Programming / Candidates should be able to / objective row 2Choose where to use a procedure
11.3 Structured Programming / Candidates should be able to / objective row 3Pass parameters by value or reference
11.3 Structured Programming / Candidates should be able to / objective row 4Define and use functionsNo linked practice
11.3 Structured Programming / Candidates should be able to / objective row 5Use a returned value within an expression
11.3 Structured Programming / Candidates should be able to / objective row 6Headers, interfaces, parameters, arguments and returns
11.3 Structured Programming / Candidates should be able to / objective row 7Efficient pseudocode construction
12.1 Program Development Life cycle / Candidates should be able to / objective row 1Purpose of development life cycles
12.1 Program Development Life cycle / Candidates should be able to / objective row 2Choose waterfall, iterative or RAD processNo linked practice
12.1 Program Development Life cycle / Candidates should be able to / objective row 3Lifecycle benefits and drawbacks
12.1 Program Development Life cycle / Candidates should be able to / objective row 4Analysis, design, coding, testing and maintenance stagesNo linked practice
12.2 Program Design / Candidates should be able to / objective row 1Structure charts, module parameters and equivalent pseudocode
12.2 Program Design / Candidates should be able to / objective row 2State-transition diagram purposes
12.3 Program Testing and Maintenance / Candidates should be able to / objective row 1Expose and avoid program faults
12.3 Program Testing and Maintenance / Candidates should be able to / objective row 2Identify syntax, logic and runtime errors
12.3 Program Testing and Maintenance / Candidates should be able to / objective row 3Correct detected errors
12.3 Program Testing and Maintenance / Candidates should be able to / objective row 4Select dry-run, walkthrough, white/black-box, integration, alpha, beta, acceptance or stub tests
12.3 Program Testing and Maintenance / Candidates should be able to / objective row 5Test strategy and test plan contentsNo linked practice
12.3 Program Testing and Maintenance / Candidates should be able to / objective row 6Choose normal, abnormal and boundary test data
12.3 Program Testing and Maintenance / Candidates should be able to / objective row 7Perfective, adaptive and corrective maintenanceNo linked practice
12.3 Program Testing and Maintenance / Candidates should be able to / objective row 8Enhance existing program functionality
A · Core (54 entries)
Computer Science 9618: A · Core
ReferenceConceptLinked practice
13.1 User-defined data types / Candidates should be able to / objective row 1Why user-defined types are needed
13.1 User-defined data types / Candidates should be able to / objective row 2Define/use enumerations and pointers
13.1 User-defined data types / Candidates should be able to / objective row 3Define/use sets, records and classes/objectsNo linked practice
13.1 User-defined data types / Candidates should be able to / objective row 4Design a suitable user-defined type
13.2 File organisation and access / Candidates should be able to / objective row 1Choose serial, key-sequential or random organisationNo linked practice
13.2 File organisation and access / Candidates should be able to / objective row 2Sequential versus direct file accessNo linked practice
13.2 File organisation and access / Candidates should be able to / objective row 3Hash algorithms for keyed file reads/writes
13.3 Floating-point numbers, representation and manipulation / Candidates should be able to / objective row 1Two's-complement mantissa/exponent format and allocation trade-offs
13.3 Floating-point numbers, representation and manipulation / Candidates should be able to / objective row 2Binary floating-point and denary conversionNo linked practice
13.3 Floating-point numbers, representation and manipulation / Candidates should be able to / objective row 3Normalisation and its purposeNo linked practice
13.3 Floating-point numbers, representation and manipulation / Candidates should be able to / objective row 4Representation limits, underflow and overflow
13.3 Floating-point numbers, representation and manipulation / Candidates should be able to / objective row 5Binary rounding errorsNo linked practice
14.1 Protocols / Candidates should be able to / objective row 1Why communication protocols are necessary
14.1 Protocols / Candidates should be able to / objective row 2Layered protocol-stack functions
14.1 Protocols / Candidates should be able to / objective row 3Four TCP/IP layers and end-to-end message handling
14.1 Protocols / Candidates should be able to / objective row 4HTTP, FTP, POP3, IMAP, SMTP and BitTorrent purposesNo linked practice
14.2 Circuit switching, packet switching / Candidates should be able to / objective row 1Circuit-switching uses and trade-offs
14.2 Circuit switching, packet switching / Candidates should be able to / objective row 2Packet switching, router forwarding and message delivery trade-offs
15.1 Processors, Parallel Processing and Virtual Machines / Candidates should be able to / objective row 1RISC/CISC differences including interrupts
15.1 Processors, Parallel Processing and Virtual Machines / Candidates should be able to / objective row 2RISC pipelining and register uses
15.1 Processors, Parallel Processing and Virtual Machines / Candidates should be able to / objective row 3SISD, SIMD, MISD and MIMD architecture
15.1 Processors, Parallel Processing and Virtual Machines / Candidates should be able to / objective row 4Massively parallel computer characteristics
15.1 Processors, Parallel Processing and Virtual Machines / Candidates should be able to / objective row 5Virtual-machine roles, benefits and limitations
15.2 Boolean Algebra and Logic Circuits / Candidates should be able to / objective row 1Half/full-adder circuit truth tablesNo linked practice
15.2 Boolean Algebra and Logic Circuits / Candidates should be able to / objective row 2SR/JK flip-flop circuits, tables and stored stateNo linked practice
15.2 Boolean Algebra and Logic Circuits / Candidates should be able to / objective row 3Boolean simplification including De Morgan
15.2 Boolean Algebra and Logic Circuits / Candidates should be able to / objective row 4Karnaugh-map simplification and benefitsNo linked practice
16.1 Purposes of an Operating System (OS) / Candidates should be able to / objective row 1Maximise resource use
16.1 Purposes of an Operating System (OS) / Candidates should be able to / objective row 2Interfaces hide hardware complexity
16.1 Purposes of an Operating System (OS) / Candidates should be able to / objective row 3Running/ready/blocked states, scheduling and kernel interruptsNo linked practice
16.1 Purposes of an Operating System (OS) / Candidates should be able to / objective row 4Paging, segmentation, page replacement and thrashingNo linked practice
16.2 Translation Software / Candidates should be able to / objective row 1Interpreter execution without saved translated program
16.2 Translation Software / Candidates should be able to / objective row 2Lexing, parsing, code generation and optimisationNo linked practice
16.2 Translation Software / Candidates should be able to / objective row 3Syntax diagrams and BNF grammarsNo linked practice
16.2 Translation Software / Candidates should be able to / objective row 4Evaluate expressions using reverse Polish notation
17.1 Encryption, Encryption Protocols and Digital Certificates / Candidates should be able to / objective row 1Symmetric/asymmetric encryption, key roles, verified/private messages and quantum cryptography
17.1 Encryption, Encryption Protocols and Digital Certificates / Candidates should be able to / objective row 2SSL/TLS purpose and client-server use
17.1 Encryption, Encryption Protocols and Digital Certificates / Candidates should be able to / objective row 3Certificate acquisition and digital signatures
18.1 Artificial Intelligence (AI) / Candidates should be able to / objective row 1Graphs and A*/Dijkstra search without required graph-construction code
18.1 Artificial Intelligence (AI) / Candidates should be able to / objective row 2Neural-network contributions to machine learningNo linked practice
18.1 Artificial Intelligence (AI) / Candidates should be able to / objective row 3Deep/reinforcement learning and supervised/unsupervised categories
18.1 Artificial Intelligence (AI) / Candidates should be able to / objective row 4Backpropagation and regression in learningNo linked practice
19.1 Algorithms / Candidates should be able to / objective row 1Implement linear/binary search; binary-search preconditions and scaling
19.1 Algorithms / Candidates should be able to / objective row 2Implement insertion/bubble sort; input-order and size effects
19.1 Algorithms / Candidates should be able to / objective row 3Search linked lists/trees; insert/delete specified ADTs; graph characteristics
19.1 Algorithms / Candidates should be able to / objective row 4Implement stack, queue, linked list, dictionary and tree from built-in types/ADTs
19.1 Algorithms / Candidates should be able to / objective row 5Compare algorithm time/space using Big O
19.2 Recursion / Candidates should be able to / objective row 1Write/trace recursive algorithms and justify recursion
19.2 Recursion / Candidates should be able to / objective row 2Compiler support via call stack and unwinding
20.1 Programming Paradigms / Candidates should be able to / objective row 1Meaning of programming paradigm
20.1 Programming Paradigms / Candidates should be able to / objective row 2Low-level, procedural, object-oriented and declarative characteristics/code, including classes and facts/rulesNo linked practice
20.2 File Processing and Exception Handling / Candidates should be able to / objective row 1Code read/write/append/close and serial, sequential, random record processing
20.2 File Processing and Exception Handling / Candidates should be able to / objective row 2Exceptions, appropriate handling and executable handlersNo linked practice
4 Details of the assessment / Paper 4 PracticalConsole Java, Python or VB.NET practical evidence; low-level/declarative excluded from Paper 4No linked practice
both · Core (11 entries)
Computer Science 9618: both · Core
ReferenceConceptLinked practice
Assessment overviewAS papers 1/2; A Level all four; no calculators
Changes to version 2 of the syllabus, published December 2025 / Other changesPaper-entry and calculator clarification, no specimen replacement
3.1 Declaring arraysExplicit array bounds; generally one-based, not universally fixed
5.4 Logic operatorsPseudocode Boolean operators AND, OR, NOT
5.5 String functions and operationsProvided string functions and & concatenation
5.6 Numeric functionsRAND returns a real from zero up to an excluded upper bound
7.1 Count-controlled (FOR) loopsInclusive bounds and integer STEP; NEXT closes FOR
8.3 Passing parameters by value or by referenceDefault BYVAL; BYREF for procedures, not functions
9.1 Handling text filesREADFILE reads a string line; WRITE truncates, APPEND preserves; EOF before readingNo linked practice
9.2 Handling random filesRANDOM, SEEK, GETRECORD with explicit record addressingNo linked practice
10.2 Constructors and InheritanceNEW constructors, INHERITS and SUPER; corrected string Breed exampleNo linked practice

Remaining academic requirements

  • Inventory scope is the complete 44 numbered content subsections and each unnumbered left-column objective row on actual PDF pages14-38, with short paraphrases incorporating selected guidance. Cambridge does not print numbered leaf outcomes here. r identifiers/row positions are internal locators, not invented official codes. Notes/bullet examples are not a separately certified exhaustive leaf taxonomy; inventory completeness does not mean teaching coverage.
  • All54 original questions were individually read, including English prompts, indicative points, worked explanations and tips. Placements are conceptual: mapped means directly evidenced activity, partial bounds the named overlap, enrichment is retained outside explicit target requirements. None is a teacher decision or a promise of full subsection attainment.
  • Source reading: 2027-29 syllabus subject content pages14-38, assessment/route objectives pages9-13 and39-40, changes page48; all31 pages of target pseudocode guide; the one-page update; comparison of 2026 guide body pages5-29 against target body. PDF pages are one-based actual pages, not browser zero-based indices.
  • December2025 version2 clarifies paper entry and no-calculator policy on page11; page48 reports no significant teaching changes. Do not treat the overview website's older2021-23 changes as2027 changes. Paper4 excludes low-level/declarative programming and requires console Java, Python or VB.NET, program code and evidence of testing; AS pseudocode answers are not a substitute.
  • Comparison of official guide bodies found the Cat Breed example corrected INTEGER to STRING at page28, a corrected Arrays running header at page11 and layout changes. No body syntax/function additions or removals were found after normalising headers/whitespace; this is not a claim that all pagination/index metadata is unchanged. Use the2027 guide, not automatic reuse of2026 references.
  • Guide cautions: generally one-based arrays are not compulsory one-based arrays when bounds are stated; RAND is a real [0,x), not AP RANDOM's inclusive integer model. AND/OR/NOT are the pseudocode Boolean operators; XOR in the circuit questions is a gate/function equation, not an invented pseudocode keyword. String functions are supplied in examinations; BYREF is for procedures, not functions.
  • Additions are original selected practice, not official questions, mark allocations, complete teaching or independent approval. All new IDs have item-specific numerical/code checks and placements, but require qualified-teacher review, language-specific execution/debugging and accessibility review before certification. The scalar gradient rule is supplied explanatory scaffolding, not a claimed required numerical formula.
  • Still uncovered/insufficient: SRAM/DRAM and ROM families; detailed printer/storage/audio/VR operations; sensor/actuator feedback; Ethernet collision mechanisms; wireless media; IPv6/static/dynamic details; cloud/thin-client application breadth; character-code conversions and sound/vector compression algorithms. Existing sampling examples do not teach the entire multimedia section.
  • Systems still need full fetch-execute transfers, two-pass assembler construction, indirect/relative addressing, arithmetic/cyclic shifts, utility/libraries/IDE evaluation, RISC/CISC/pipelining/Flynn architectures and virtual machines. One indexed assembly trace is not mastery of every instruction/addressing mode.
  • OS/translators still need blocked-state transitions and scheduling policies beyond the round-robin trace; segmentation, virtual-memory/thrashing cases; compiler code generation/optimisation and richer syntax diagrams. One FIFO trace does not establish every replacement-policy requirement.
  • Database/development gaps remain: dictionary/query-processor implementation roles, full entity modelling, nontrivial normalisation cases, SQL ALTER/INSERT/UPDATE/DELETE and additional aggregates. More abstraction/decomposition, flowcharts, structure charts, state-transition diagrams, CASE/string-function programs, test-method comparisons and maintenance enhancements remain required.
  • Practical gaps remain: complete binary-search/insertion-sort code, linked-list/tree search/insert/delete implementations across cases, dictionary implementation, pointer/enumerated/set programs, file update/sorted-sequential routines, comprehensive exception paths, OOP aggregation and multi-class polymorphism. Low-level and declarative facts/rules coding are still theory requirements despite Paper4 exclusion; neither was silently marked covered.
  • AI/security/ethics gaps remain: richer neural-network/backpropagation, reinforcement/deep learning, regression evaluation, quantum/public/private-key encryption, TLS/certificates/digital signatures, professional bodies and licence comparisons. No claim that a single ethical scenario or scalar regression update establishes these requirements. Further long-response analysis and supervised practical evidence remain genuinely necessary.

Return to Computer Science practice