H2 Computing — Promotional exam notes
One revision copy with explanations, worked examples, practice and reminders based on your diagnostic. Read alongside your existing Obsidian resources and open the original PDFs in Adobe Acrobat. The chapter source trails let you return to fuller explanations and original questions.
Exam scope
Your promotional scope controls this pack: ethics and societal impact, the four named Singapore laws, relational databases and NoSQL theory, networks with representation/check digits, and Python Chapters 1–8 through circular queues. Linked lists and stacks are included. Trees and later data structures, standalone searching/sorting, web implementation and NoSQL coding are outside this agreed boundary. The 21 entries are revision units, not 21 school-numbered chapters.
Reading and practice
Start with each chapter’s Exam recall box. Trace the illustrated example, hide it, then attempt the questions without notes. Use the separate solutions to check the result and the reason.
The scope includes Study Time and Lab. Practise explanation, tracing and implementation; follow your teacher’s current instructions for delivery format and permitted tools. Tick a checklist item only after demonstrating it without help.
Answer pattern: definition → scenario fact → consequence. For code: contract → state/diagram → algorithm → boundary test. A diagram supports an explanation; label its pointers, keys or values clearly.
Priority key
- 🔴 High (
#priority/high): core understanding, recurring paper applications or a diagnostic weakness. - 🟡 Medium (
#priority/medium): supporting knowledge and applications to consolidate after the core. - 🟢 Low (
#priority/low): supplementary reference or extension; this does not mean excluded from scope.
The labels are section-specific, not predictions of the upcoming paper. Yellow highlights isolate important rules and distinctions. Equality operators in prose use inline code, such as size == 0, so they do not become unintended highlights. The vault’s priority CSS snippet colours the tags while retaining their text labels.
Questions and solutions
Each chapter contains direct notes, a worked example, questions with optional hints, a checklist and mindmap branch labels. Solutions are separate so you can attempt a question without seeing its answer. Questions marked original are written for this pack; adapted questions change a named paper’s setting or wording. Original-paper references are additional practice, not a claim that our wording or marks are official.
Your main diagnostic reminders:
- Translate “more than” into
>and “at least” into>=before writing code. - Write down exactly what must be returned: one value, a tuple or a list. Printing is a separate action.
- Trace the state after each iteration. Do not guess outputs from the overall pattern.
- A recursive call must return before its caller can finish its expression.
- Queue pointers describe logical order; the array’s visual left-to-right order can differ after wrapping.
- Explain database anomalies with an actual insert, update or delete and its consequence.
No session timetable is imposed. The checklists describe what you should be able to demonstrate, and the mindmap branches are yours to fill.
Chapters
Sources and boundaries
Sources explains source selection, links to the supplied originals and records extraction limitations. Past-paper recurrence is evidence that a skill has been assessed; it is not a prediction of your upcoming paper. The earlier framework pack remains separate.
Self-learning reading guide recommends VJC, A notes and selected school resources for each of the 21 chapters, with PDF page references and practice checkpoints.
Chapter mindmaps - 21 visual revision maps, text versions and a printable PDF collection.