Suggested Learning Path
The topic folders use stable names instead of number prefixes. Use this page when you want a recommended order of study.
The order follows the H2 Computing syllabus and the practical dependencies between topics. It is a learning path, not a rule that every student must follow exactly.
Text Path
- Start
- Algorithmic Representation
- Core algorithm and data foundations
- Programming foundations and implementation
- Data and information
- Networks, web, and security
- Emerging technologies
- Lab Exam and Project Skills
How to Use This Path
- Learn algorithmic representation before algorithms, because pseudocode, flowcharts, decision tables, and decomposition are used throughout the course.
- Learn fundamental algorithms before data structures, because tracing and complexity ideas become easier when the basic algorithm patterns are familiar.
- Learn programming fundamentals before implementation-heavy topics, because Paper 2 expects students to turn ideas into working Python.
- Learn validation, testing, and debugging early enough that it becomes a habit, not a final cleanup step.
- Learn databases before web applications if possible, because many web-app tasks store, retrieve, validate, or display data.
- Learn networks before web applications and network security, because client-server ideas, protocols, IP addresses, DNS, and packet switching support both.
- Learn AI and ML after core programming and data topics, because simple ML programs rely on lists, loops, functions, testing, and data preparation.
- Use lab exam and project skills throughout the course, then revisit it near assessment time.
Optional Enrichment
Some notes explain real-world context beyond exam-core scope. They are useful for understanding modern computing, but they should not replace syllabus-focused revision.
Examples include: