From blocks to distributed systems
The coding ladder: a first repeat block, Python, algorithms, Git, and finally consensus in a real cluster. The goal: climb from a child's first loop to a third-year university topic, one locked step at a time.
Aligned towards CSTA, PCEP, GCSE, CS2023, every alignment in review. Levels 1 to 17. University-level modules give knowledge, not university credit.
The route, stop by stop.
In the order a learner would take it. Prerequisites from outside the pathway are assumed known, or cleared by a Challenge Test.
- CO-BLK-SEQ-01Instructions in orderCoding · Primary 1 to Primary 4 (Level 1–4) · Planned
- CO-BLK-LOP-01Repeat blocksCoding · Primary 3 to Primary 5 (Level 3–5) · Sample lesson in the demo Needs Instructions in order (required).Try the sample lesson: Repeat blocks
- CO-BLK-LOP-02Patterns with loopsCoding · Primary 4 to Primary 6 (Level 4–6) · Planned Needs Repeat blocks (required).
- CO-PRG-PYB-01Your first Python programCoding · JSS 1 to JSS 3 (BECE) (Level 7–9) · Planned Needs Patterns with loops (required).
- CO-PRG-PYB-02VariablesCoding · JSS 1 to JSS 3 (BECE) (Level 7–9) · Sample lesson in the demo Needs Your first Python program (required).Try the sample lesson: Variables
- CO-PRG-PYB-03Numbers and calculationsCoding · JSS 1 to JSS 3 (BECE) (Level 7–9) · Planned Needs Variables (required).
- CO-PRG-PYB-04Text and inputCoding · JSS 1 to SSS 1 (Level 7–10) · Planned Needs Variables (required).
- CO-PRG-PYB-05Decisions with ifCoding · JSS 2 to SSS 1 (Level 8–10) · Planned Needs Numbers and calculations (required).
- CO-PRG-PYB-06Loops in PythonCoding · JSS 2 to SSS 1 (Level 8–10) · Planned Needs Decisions with if (required).
- CO-PRG-PYF-01Defining functionsCoding · JSS 2 to SSS 2 (Level 8–11) · Planned Needs Loops in Python (required).
- CO-PRG-PYF-02Parameters and return valuesCoding · JSS 3 (BECE) to SSS 2 (Level 9–11) · Planned Needs Defining functions (required).
- CO-PRG-PYF-03ScopeCoding · JSS 3 (BECE) to SSS 2 (Level 9–11) · Planned Needs Parameters and return values (required).
- CO-PRG-PYF-04Breaking problems into functionsCoding · JSS 3 (BECE) to SSS 3 (WASSCE) (Level 9–12) · Planned Needs Parameters and return values (required), Lists (required).
- CO-PRG-PYF-05RecursionCoding · SSS 2 to A level / JUPEB / foundation year (Level 11–13) · Planned Needs Scope (required).
- CO-ALG-SRT-01Linear searchCoding · JSS 3 (BECE) to SSS 2 (Level 9–11) · Planned Needs Parameters and return values (required), Lists (required).
- CO-ALG-SRT-02Binary searchCoding · SSS 1 to SSS 3 (WASSCE) (Level 10–12) · Planned Needs Linear search (required).
- CO-ALG-SRT-03Simple sortsCoding · SSS 1 to SSS 3 (WASSCE) (Level 10–12) · Planned Needs Linear search (required).
- CO-ALG-SRT-04Merge sortCoding · SSS 2 to A level / JUPEB / foundation year (Level 11–13) · Planned Needs Simple sorts (required), Recursion (required).
- CO-ALG-SRT-05Comparing algorithmsCoding · SSS 3 (WASSCE) to A level / JUPEB / foundation year (Level 12–13) · Planned Needs Binary search (required), Merge sort (required).
- CO-SWD-GIT-01Why version control?Coding · SSS 3 (WASSCE) to A level / JUPEB / foundation year (Level 12–13) · Planned Needs Parameters and return values (required).
- CO-SWD-GIT-02Commits and historyCoding · SSS 3 (WASSCE) to A level / JUPEB / foundation year (Level 12–13) · Planned Needs Why version control? (required).
- CO-SWD-GIT-03Branches and mergingCoding · A level / JUPEB / foundation year to 100 Level (Level 13–14) · Planned Needs Commits and history (required).
- CO-SWD-GIT-04Working together with remotesCoding · A level / JUPEB / foundation year to 100 Level (Level 13–14) · Planned Needs Branches and merging (required).
- CO-NET-HOW-01Packets, addresses and routesCoding · JSS 1 to SSS 1 (Level 7–10) · Planned
- CO-SYS-OPS-01What an operating system doesCoding · JSS 2 to SSS 2 (Level 8–11) · Planned
- From here on: Beyond school · university levelCO-DST-CCR-01Doing many things at onceCoding · 100 Level to 200 Level (Level 14–15) · Planned Needs Breaking problems into functions (required), Comparing algorithms (required), What an operating system does (recommended).
- CO-DST-FND-01What makes a system distributedCoding · 200 Level (Level 15) · Planned Needs Doing many things at once (required), Packets, addresses and routes (required), Working together with remotes (required).
- CO-DST-REP-01Why replicate?Coding · 200 Level to 300 Level (Level 15–16) · Planned Needs What makes a system distributed (required).
- CO-DST-REP-02Leaders and followersCoding · 200 Level to 300 Level (Level 15–16) · Planned Needs Why replicate? (required).
- CO-DST-REP-03Time, clocks and orderingCoding · 200 Level to 300 Level (Level 15–16) · Planned Needs Why replicate? (required).
- CO-DST-REP-04Consensus: agreeing despite failuresCoding · 300 Level (Level 16) · Planned Needs Leaders and followers (required), Time, clocks and ordering (required).
- CO-DST-REP-05Raft step by stepCoding · 300 Level to 400–500 Level (Level 16–17) · Planned Needs Consensus: agreeing despite failures (required).
- CO-CLD-CTR-01Containers with DockerCoding · 100 Level to 200 Level (Level 14–15) · Planned Needs What an operating system does (required).
- CO-DST-REP-06Lab: a three-node cluster on the LanternCoding · 300 Level to 400–500 Level (Level 16–17) · Planned · the destination Needs Raft step by step (required), Containers with Docker (recommended).
Other routes through the map.
First steps on a computer
Use a computer confidently and safely: point, type, save, find and search.
11 stops
- From
- First steps at a Lantern station Level 1 · Primary 1
- To
- Searching the live web Level 9 · JSS 3 (BECE)
WASSCE Mathematics: algebra
Be ready for the linear-equation and formula questions in WASSCE Mathematics.
11 stops
- From
- Order of operations Level 5 · Primary 5
- To
- Linear inequalities Level 9 · JSS 3 (BECE)
Is Electrical Engineering for me?
Find out whether Electrical/Electronic Engineering is the degree for you.
10 stops
- From
- What engineers do Level 8 · JSS 2
- To
- Kirchhoff's laws Level 14 · 100 Level
Help light the Lantern where this route starts.
Every pathway begins at a learning station in a village. Four Lanterns are planned and waiting for light.