Singapore H2 Computing Wiki

Suggested Learning Path

2 min read

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.

Visual Path

flowchart LR
    A["Represent<br/>pseudocode, flowcharts"]
    B["Core CS<br/>algorithms, data structures"]
    C["Programming<br/>Python, testing, OOP"]
    D["Data and Issues<br/>representation, databases, ethics"]
    E["Networks and Web<br/>networks, web apps, security"]
    F["Lab Readiness<br/>workflow, files, debugging"]

    A --> B --> C --> D --> E --> F

Text Path

Start
|- Algorithmic Representation
|- Fundamental Algorithms
|- Data Structures
|- Programming Fundamentals
|  |- Implementing Algorithms and Data Structures
|  |- Validation, Testing, and Debugging
|  `- Object-Oriented Programming
|- Data Representation and Encoding
|- Databases and Data Management
|- Social, Ethical, Legal, and Economic Issues
|- Computer Networks
|  |- Web Applications
|  `- Network Security
`- Lab Exam and Project Skills
  1. Algorithmic Representation
  2. Fundamental Algorithms
  3. Data Structures
  4. Programming Fundamentals
  5. Implementing Algorithms and Data Structures
  6. Data Validation, Testing, and Debugging
  7. Fundamentals of Object-Oriented Programming
  8. Data Representation and Character Encoding
  9. Databases and Data Management
  10. Social, Ethical, Legal, and Economic Issues
  11. Fundamentals of Computer Networks
  12. Web Applications
  13. Network Security
  14. 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.
  • 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:

Graph View