H2 Computing support that helps you work it out
MOE/SEAB A-Level H2 Computing (9569): number bases and two’s complement, Object-Oriented Programming (encapsulation, inheritance, polymorphism) and recursion in Python, stacks, queues, linked lists, binary search trees and hash tables, searching/sorting and Big-O complexity, 3NF relational SQL and NoSQL databases, networking and web apps (Flask/sockets).
8 tracked MOE/SEAB skills, from number bases (binary, octal, hex), two’s complement, floating-point and character encoding to software development life cycles, black/white-box testing, validation and pdpa ethics. The tutor asks focused questions, you test the next step, and the understanding stays yours.
Beta subject: H2 Computing uses a domain-specific Socratic rubric and is currently marked Beta while we benchmark its scaffolding across full JC 1–2 (A-Level 9569) papers.
What a h2 computing tutor covers
Each skill is tracked separately so strong chapters never mask a shaky prerequisite.
- 1
Number bases (binary, octal, hex), two’s complement, floating-point and character encoding
Foundation skillConvert between number bases, perform two’s complement arithmetic, analyse overflow/precision errors and compare ASCII and Unicode UTF-8.
- 2
Object-Oriented Programming (encapsulation, inheritance, polymorphism) and recursion
Builds on Number bases (binary, octal, hex), two’s complement, floating-point and character encodingDesign Python class hierarchies with private attributes, method overriding and polymorphic dispatch, and trace recursive call stacks vs iterative equivalents.
- 3
Stacks, linear/circular queues, linked lists, binary search trees (BST) and hash tables
Builds on Object-Oriented Programming (encapsulation, inheritance, polymorphism) and recursionImplement pointer/array-based ADTs from scratch, trace in-order/pre-order/post-order tree traversals and resolve hash collisions via chaining or linear probing.
- 4
Linear/binary search, bubble/insertion/merge/quicksort and Big-O time/space complexity
Builds on Stacks, linear/circular queues, linked lists, binary search trees (BST) and hash tablesTrace partitioning and merging steps on sample arrays and compare best-, average- and worst-case time and auxiliary space complexities.
- 5
Entity-Relationship diagrams, 1NF–3NF normalisation, SQL/sqlite3 and NoSQL document stores
Builds on Stacks, linear/circular queues, linked lists, binary search trees (BST) and hash tablesEliminate partial and transitive functional dependencies up to 3NF, write multi-table SQL JOIN/GROUP BY queries with parameterised statements, and compare relational vs MongoDB schemas.
- 6
OSI/TCP-IP layers, packet switching, subnetting, asymmetric encryption and network security
Foundation skillCompare LAN/WAN topologies, DNS/HTTP/TCP/UDP protocols, public-key encryption, digital signatures, firewalls and SQL-injection/XSS defences.
- 7
Web applications (HTML/CSS, Flask routing, Jinja2 templates) and client-server sockets
Builds on Entity-Relationship diagrams, 1NF–3NF normalisation, SQL/sqlite3 and NoSQL document storesBuild full-stack Python Flask applications processing GET/POST forms with SQLite persistence, and program TCP socket client-server message exchange.
- 8
Software development life cycles, black/white-box testing, validation and PDPA ethics
Builds on Linear/binary search, bubble/insertion/merge/quicksort and Big-O time/space complexityDesign normal, boundary and erroneous test cases, trace dry-run tables, and evaluate privacy, intellectual property and algorithmic bias under Singapore’s PDPA.
How a h2 computing session unfolds
The student starts by asking for the answer—and ends up solving the key step themselves.
- Student
Why is my SQL query `SELECT * FROM Students WHERE Name = "user_input"` marked wrong for security in H2 Computing? How do I fix it in Python `sqlite3`?
- Tutor
Imagine a user enters `" OR "1"="1` as `user_input`. Write out the resulting SQL string when you concatenate it directly into the `WHERE` clause.
- Student
It becomes `SELECT * FROM Students WHERE Name = "" OR "1"="1"`, which evaluates to true for every row and dumps the whole table — that’s SQL injection!
- Tutor
Exactly. How does Python’s `sqlite3` module let you separate the SQL command structure from the user-supplied data so the input is never parsed as executable SQL?
- Student
Use a parameterised query with a `?` placeholder and pass a tuple: `cursor.execute("SELECT * FROM Students WHERE Name = ?", (user_input,))`.
- Tutor
Spot on — the `?` placeholder and single-element tuple `(user_input,)` with the trailing comma prevent SQL injection completely.
About this illustrative example
This walkthrough is an illustrative script written to show how the five-level hint progression works in H2 Computing, not a transcript from a real student account.
Have a h2 computing question right now?
Bring your own school worksheet problem or test our interactive whiteboard with zero login required.
How skill progress is recorded
Sessions build a clear skill record for the student and a calm, read-only summary for linked parents.
One bar per skill
Mastery is tracked skill by skill, not as a single subject percentage, so a strong topic cannot hide a weak one.
The hint level counts
Getting something right with one small hint moves the bar more than getting it right after five. The number we show you reflects how much help you needed.
Built from an event log
Every attempt, hint and explanation is recorded as an event, and the bars are calculated from that history. It can be replayed, which means the numbers are reproducible rather than asserted.
A parent sees the same numbers
A linked parent gets the same skill bars, the last judgement and its line of evidence behind each level, the recent session summaries and the flag counts — read-only, and nothing that is not also on your own pages.
8 skill bars, tracked independently
In h2 computing, that means 8 separate skill bars — number bases (binary, octal, hex), two’s complement, floating-point and character encoding, object-oriented programming (encapsulation, inheritance, polymorphism) and recursion, stacks, linear/circular queues, linked lists, binary search trees (bst) and hash tables, and the rest — each updating based on verified problem steps. Linked parents see the same topic bars and session takeaways in read-only mode.
H2 Computing FAQs
Common questions from students and parents about studying this subject on tutor.ai.
Which A-Level H2 Computing (9569) topics are tracked?
Aligned to Singapore A-Level H2 Computing (9569, in Beta). Eight skills, in syllabus order: Number bases (binary, octal, hex), two’s complement, floating-point and character encoding; Object-Oriented Programming (encapsulation, inheritance, polymorphism) and recursion; Stacks, linear/circular queues, linked lists, binary search trees (BST) and hash tables; Linear/binary search, bubble/insertion/merge/quicksort and Big-O time/space complexity; Entity-Relationship diagrams, 1NF–3NF normalisation, SQL/sqlite3 and NoSQL document stores; OSI/TCP-IP layers, packet switching, subnetting, asymmetric encryption and network security; Web applications (HTML/CSS, Flask routing, Jinja2 templates) and client-server sockets; and Software development life cycles, black/white-box testing, validation and PDPA ethics.
Will the tutor write my Python OOP class, BST traversal or SQL query for me?
No. It asks you to state the base case, pointer update or functional dependency first, and helps you trace your own code or schema against boundary and edge cases.
Can I draw linked-list pointers, binary search trees and ER diagrams on the whiteboard?
Yes — sketch your node pointers, tree rotations or 3NF relational tables on the shared whiteboard and the tutor will verify whether any pointers are lost or partial/transitive dependencies remain.
Why is H2 Computing marked Beta?
Multi-file Flask/SQLite/socket lab scaffolding and Big-O complexity proofs are marked Beta while we expand automated verification.
More JC 1–2 (A-Level 9569) subjects
Switch between subjects at the same school level or open the full catalogue.
H2 Mathematics
MOE/SEAB A-Level H2 Mathematics (9758): Pure Mathematics (functions, graphs and transformations, sequences and series, vectors in 3D, complex numbers, calculus and differential equations) and Probability & Statistics (permutations, distributions, hypothesis testing and correlation).
H2 Chemistry
MOE/SEAB A-Level H2 Chemistry (9729): atomic structure and VSEPR bonding, chemical energetics and Born-Haber cycles, reaction kinetics, ionic equilibria and buffers, organic reaction mechanisms, electrochemistry and transition elements.
H2 Physics
MOE/SEAB A-Level H2 Physics (9749): Newtonian mechanics, circular motion and gravitation, oscillations and wave superposition, thermal physics, electric and magnetic fields, electromagnetic induction, AC circuits, quantum physics and nuclear physics.
H2 Economics
MOE/SEAB A-Level H2 Economics (9570): price mechanism and elasticities (PED, PES, YED, XED), market failure and government micro intervention, firms and market structures, macroeconomic circular flow and AD/AS, monetary/fiscal/supply-side policies, international trade and case-study evaluation.
Bring your h2 computing question
Free during testing, with no credit card required.