Assessment Overview & Difficulty Verdict

The June 2026 AS Level Computer Science sitting (Papers 11 and 21) maintained Cambridge's standard structure while demanding sharp precision in pseudocode syntax and technical terminology. Paper 11 tested foundational hardware, networking, and data representation alongside SQL commands (including aggregate functions and table modification), while Paper 21 placed substantial weight on modular programming, record structures, and abstract data type operations. The overall difficulty is rated at 3.2 / 5.0—accessible for well-prepared candidates who have practiced standard algorithmic patterns, but unforgiving of vague explanations.

Where the Marks Were Won and Lost

  • Core Strengths: High scoring was common on basic data conversions (binary, hexadecimal, and two's complement in Paper 11 Q1) and trace tables for binary search in Paper 21 Q8. Candidates also scored reliably on standard SQL `SELECT` queries and logic gate truth tables.
  • Examiner Pitfalls: Significant mark loss occurred in detailed descriptive questions, particularly explaining Ethernet collision detection (CSMA/CD) in a bus topology and distinguishing validation from verification in data integrity contexts. In Paper 21, candidates struggled with string extraction functions requiring composite length offsets (such as `MID` with dynamic expressions) and the wrap-around pointer manipulation in circular queues.

Paper-by-Paper Strategy

In Paper 11 (Theory Fundamentals), candidates must allocate time to write precise technical keywords rather than informal prose. Definitions of terms like static private IP and descriptions of assembly addressing modes require full technical criteria to earn full marks.

In Paper 21 (Problem-solving and Programming), pseudocode structure is paramount. Proper initialization of variables, strict boundary checks in loops, correct use of dot notation (`Record.Field`), and adherence to the standard pseudocode guide provided in the insert ensure maximum marks on the high-tariff 6-mark and 7-mark programming tasks.

Future Paper Predictions

Given the heavy rotation of circular queues in this sitting, upcoming series are highly likely to test Linked Lists or Stack ADTs in Paper 2. In Paper 1, expect an increased focus on Security (encryption, digital certificates) and Processor Architecture registers (MAR, MDR, CIR), which received relatively light coverage here.