Sources, original questions and review notes
How this pack uses your materials
Your stated promotional scope is the boundary. The 2027 syllabus and HCI school material establish the learning outcomes; HCI promotional papers establish concrete assessment patterns. The existing MOE, VJC and senior resources inform the cross-checking and concise organisation. This is an independently written revision synthesis, not an official marking scheme or a replacement for reading your resources.
The 21 chapters each contain a worked example and at least two independent questions, with additional practice for normalisation, SQL, recursion, OOP, linked lists, stacks and queues. Original means written for this pack. Adapted means a named paper supplied the assessed skill or scenario but the prompt here is changed and self-contained. Do not assume the original paper’s marks apply to our adaptations. No questions are presented as verbatim copies.
PDF page numbers below mean positions in the PDF. The copied originals can be opened in Adobe Acrobat; the three school figure embeds are unchanged rendered pages from those originals. New revision diagrams are labelled separately below.
Original promotional papers
| Paper | Relevant original questions |
|---|---|
| HCI 2024 | Q1–2 protocols/DNS/DHCP; Q3 validation/ethics; Q4 recursion; Q5 database; Q6 representation; Q7 circular queue; Q8 OOP; Q9 2D grid. |
| HCI 2025 | Q1 OOP; Q2 networking/subnet; Q3 ethics/encoding; Q4 check digit; Q5 database/SQL; Q6 linked queue; Q7 recursion; Q8 factor/perfect-number programming. |
| HCI 2023 | Q1–2 protocols/validation/ethics; Q3 Boolean recursion; Q4 representation; Q5 OOP; Q6 database; Q7 sorted linked list; Q8 grid traversal. |
| HCI 2022 modified compilation | Q1–2 networks/validation; Q3 recursive conversion; Q4 networking/ethics; Q5 database; Q6 OOP; Q7 stacks; Q8–9 programming. This is a modified compilation, not a separate intact assessment. |
| ASRJC 2025 | Q1 recursive power, PDF p.2; Q3 networking, p.3; Q4 OOP, pp.3–4; Q5 encoding, p.4. Q2 searching/sorting is outside the agreed scope. |
The queue extension in Chapter 21 was previously attributed to a VJC prelim filename dated 2025, with some 2024 footers. That original file is not currently available at its linked location; treat 21C as an independently checkable supplementary exercise, not evidence of promo recurrence.
Main teaching sources
School files are in the extracted HCI teaching folder:
| Units | Main files |
|---|---|
| 01 | Ethics/H2_Computing_Ethics_Combined.pdf |
| 02–03 | Data Representation/Data Representation.pdf, Check Digit.pdf; Python introduction/testing material |
| 04–06 | DBMS/1. Introduction to DBMS.pdf through 6. SQL2.pdf |
| 07 | CPDD Introduction to NoSQL, February 2019; retain relevant theory, qualify dated product/generalisation claims |
| 08–11 | Networks/Network1.pdf through Network5.pdf |
| 12–18 | Python/1. Introduction.pdf through 7. Object Oriented Programming.pdf |
| 19–21 | Python/8. Data Structures.pdf, §§8.1–8.5, PDF pp.1–39 |
The 2027 syllabus establishes learning outcomes; the current promo scope establishes the immediate boundary. Full A-Level delivery format does not establish promo delivery format. The current vault contains your other teaching resources.
Embedded figures
- Chapter 05: school ERD p.52, M:N resolved with a linking entity.
- Chapter 11: Network4 p.6, sender/receiver checksum process.
- Chapter 21: Data Structures p.36, linear and circular array queues.
The Mermaid diagrams and text traces elsewhere are newly written for the examples. They are not extracted school figures.
Corrections carried into this pack
The September audit records the latest findings. Key corrections retained here concern ARP/ICMP/IGMP, qualified NoSQL comparisons, Python state and scope, recursive returns, negative floor division, dependencies and PDPA/POFMA wording. The previous version of this pack was backed up before the authorised implementation.
This pack also corrects School Network3 p.41: 201.24.67.32 is Class C under classful addressing, not Class B. Explicit CIDR prefixes still take precedence over class defaults. TCP acknowledgement fields are labelled separately from sequence fields, correcting confusing labels in school slides.
Revision design and limits
Use the Exam recall boxes, illustrated states and short worked examples for retrieval. Solutions give results before optional explanation where practical. Practice additions are original drills; they do not carry invented official marks. Past-paper recurrence guides practice and never overrides explicitly taught scope.
The coloured diagrams added in September 2026 are original teaching illustrations, not school figures. The three older school figure embeds retain their original sources above.
The NoSQL handout is dated February 2019. Its MongoDB shell instructions and broad claims about costs, scaling and availability are not current universal rules. Chapter 07 retains the relevant theory with qualifications; NoSQL coding is outside this promo scope.
Earlier ingestion counts include duplicates and partial extractions. Text extraction can lose diagrams and indentation. Unread scanned paper content is not evidence here. The revision-package source audit and source index preserve the usable source trail. Some older review/archive paths are unavailable and have been removed rather than guessed.
The implemented pack has 66 numbered practice tasks and 21 solution files.