The 20-route learning estate
eduKateSengkang is organised as a Learning Castle: existing subject hubs, level routes, examination routes and learning-system pages retain their jobs. This page is the master upgrade directory. It does not replace those owners. It makes the work visible, assigns every upgrade to one route, and gives new or substantially revised articles stable IDs so later batches can be connected without losing track of what is complete.
Numbering rule
Each route has a -000 hub pointer. Article slots then use reserved tens: -010, -020, -030 and so on. The first upgrade programme reserves up to 150 article slots per route, ending at -1500. Existing high-value URLs are upgraded in place wherever practical; the ID identifies the editorial job, not a requirement to create a new URL.
| Route | Hub ID | Primary job | Existing owner / destination | Reserved article IDs | Status |
|---|---|---|---|---|---|
| SK-01 | SK-01-000 | Homepage, Sengkang Tuition, commercial/navigation/root accuracy | Homepage / Tuition Centre owner | SK-01-010–SK-01-1500 | OPEN |
| SK-02 | SK-02-000 | Primary 1–3 English | Primary English Learning Hub | SK-02-010–SK-02-1500 | OPEN |
| SK-03 | SK-03-000 | Primary 4–6 English + PSLE English | Primary English Learning Hub / PSLE Learning Guide | SK-03-010–SK-03-1500 | OPEN |
| SK-04 | SK-04-000 | Secondary 1–2 English | English Hub | SK-04-010–SK-04-1500 | OPEN |
| SK-05 | SK-05-000 | Secondary 3–4 English + SEC English | English Hub | SK-05-010–SK-05-1500 | OPEN |
| SK-06 | SK-06-000 | Vocabulary, grammar, reading, writing and English skills | Complete English Index | SK-06-010–SK-06-1500 | OPEN |
| SK-07 | SK-07-000 | Primary 1–3 Mathematics | Mathematics Hub | SK-07-010–SK-07-1500 | OPEN |
| SK-08 | SK-08-000 | Primary 4–6 Mathematics + PSLE Mathematics | Mathematics Hub / PSLE Learning Guide | SK-08-010–SK-08-1500 | OPEN |
| SK-09 | SK-09-000 | Secondary 1–2 Mathematics | Mathematics Hub | SK-09-010–SK-09-1500 | OPEN |
| SK-10 | SK-10-000 | Secondary 3–4 Mathematics + SEC Mathematics | Mathematics Hub | SK-10-010–SK-10-1500 | OPEN |
| SK-11 | SK-11-000 | Additional Mathematics | Additional Mathematics owner | SK-11-010–SK-11-1500 | OPEN |
| SK-12 | SK-12-000 | Primary 3–4 Science | Science Hub | SK-12-010–SK-12-1500 | OPEN |
| SK-13 | SK-13-000 | Primary 5–6 Science + PSLE Science | Science Hub / PSLE Science Learning Guide | SK-13-010–SK-13-1500 | OPEN |
| SK-14 | SK-14-000 | Secondary Science + scientific reasoning | Science Hub | SK-14-010–SK-14-1500 | OPEN |
| SK-15 | SK-15-000 | Learning Castle, Learning Runtime and study methods | Learning Runtime Hub | SK-15-010–SK-15-1500 | OPEN |
| SK-16 | SK-16-000 | Examination performance, revision, assessment and error repair | Examination Craft | SK-16-010–SK-16-1500 | OPEN |
| SK-17 | SK-17-000 | Parent guides, tuition, teaching and student support | Parents’ Guide | SK-17-010–SK-17-1500 | OPEN |
| SK-18 | SK-18-000 | Algorithms, computing and advanced mathematics | Algorithms & Computing Hub | SK-18-010–SK-18-1500 | OPEN |
| SK-19 | SK-19-000 | Advanced science and world-knowledge science material | Complete Science Index | SK-19-010–SK-19-1500 | OPEN |
| SK-20 | SK-20-000 | Estate archaeology: duplication, location leakage, orphan control, cannibalisation and consolidation candidates | Learning Castle Registry | SK-20-010–SK-20-1500 | OPEN |
Article register
The first-wave titles and status ledger are live in the eduKate Sengkang Article Register | SK-01 to SK-20. Use it to claim the next article ID, see protected owners and avoid duplicating work already active in another branch.
Protection-first reader standard
All 20 branches now follow the eduKate Sengkang Reader Experience Standard: protect strong pages, connect isolated pages, improve formatting only where it helps, use bounded surgery for specific defects, and modernise only when the existing article no longer completes its reader job.
Article state
Every inspected URL receives one state before work begins: PROTECT for ranking or strategically sensitive owners; KEEP for sound pages needing no substantial rewrite; MODERNISE for useful but outdated pages; SURGERY for small bounded repairs; RETARGET for pages that need a distinct adjacent search job; CONSOLIDATION CANDIDATE for overlapping intent that requires owner review; LOCATION LEAKAGE for misplaced locality; or HISTORICAL for material worth preserving without major reinvestment.
Completion rule
An article ID becomes complete only when the assigned existing URL or new article has a defined reader job, correct owner, current factual scope, useful internal return path and no unresolved collision with another Sengkang owner. A branch can therefore inspect more than 150 URLs without rewriting 150 pages. The 150 slots are a controlled first-wave capacity, not a quota.
Castle relationship
This programme sits under the existing Learning Castle and follows its one-owner-many-routes rule. English, Mathematics, Science, Examination Craft, Learning Runtime and Algorithms retain their existing canonical roles. The master directory exists to coordinate upgrades and make unfinished work visible; it does not create twenty competing subject hubs.
Complete-index crosswalk
Use the 20 routes above to decide ownership and upgrade work. Use these Complete Archives when the job is enumeration, orphan control or direct deep-article discovery.
English Archive · Mathematics Archive · Science Archive · Examination Archive · Learning Runtime Archive · Algorithms & Computing Archive
Deep fallback discovery
The subject hubs and Complete Archives remain the preferred routes. These live indexes are the final orphan-control layer: they expose every published Page and Post through paginated internal links so newly published or unusually placed content still has a crawlable return path while specialist routing is updated.
Browse every published Page
-
How Writing Works for a Student | From Purpose to Reader-Ready Text
-
I Am Brave: The First Term of Secondary 1
-
I Am Brave: The Primary 6 Year
-
I Am Brave: The Secondary 4 Year
-
Independent Adulthood Tutor | Curie Series | Building a Life That Can Run
-
Independent Attempt | What the Learner Can Carry Without Hidden Help
-
Information & Media Literacy Tutor | Curie Series | Learning to Keep Representations Correctable
-
Interface Verification | Can the Parts Work Together?
-
Is a 3-Pax Class the Right Fit for My Child?
-
Is This Tuition Class the Right Fit? | How Parents Can Evaluate Small-Group Tuition in Sengkang
-
JC1 English Tutor | Curie Series | From Secondary English to General Paper and Academic Argument
-
JC1 Mathematics Tutor | Curie Series | From Secondary Mathematics to Calculus, Statistics and Modelling
-
JC1 Science Tutor | Curie Series | From Secondary Science to A-Level Disciplinary Depth
-
JC2 English Tutor | Curie Series | Evidence, Argument and A-Level Independence
-
JC2 Mathematics Tutor | Curie Series | A-Level Integration, Mathematical Judgement and Independence
-
JC2 Science Tutor | Curie Series | A-Level Integration, Practical Evidence and Scientific Independence
-
June Holiday Revision Plan 2027 for P5, P6, Sec 3 and Sec 4
-
Keep Steward | Learner Capability and Independence Agent
-
Keymaster | Evidence and Permission Agent
-
Knowing When to Ask for Help | Marie Curie Series | Where Independent Learning Should Hand Back to Support
-
Later-Career & Stewardship Tutor | Curie Series | Expertise, Succession and Responsibility
-
Later-Life Learning Tutor | Curie Series | Maintain, Adapt, Grow and Contribute
-
Launch Commit Criteria | What Must Be True Before We Proceed?
-
Leadership & People Responsibility Tutor | Curie Series | Learning to Carry Responsibility for Others
-
Learning & Reskilling Tutor | Curie Series | How Adults Build New Capability
-
Learning Castle Admission Schema
-
Learning Castle Agent Guild | Operations Council
-
Learning Castle AI Discovery Schema | Machine Entry and Interpretation
-
Learning Castle Boot Protocol | Runtime Load Order for AI
-
Learning Castle Edge Schema | Roads, Bridges and Return Paths
-
Learning Castle Fort Schema | Domain Ownership and Capability Runtime
-
Learning Castle Gate Schema | Inputs, Keys and Permitted Transitions
-
Learning Castle Inheritance and Fallback Schema
-
Learning Castle Key Schema | Evidence, Permission and Confidence Keys
-
Learning Castle Node Schema | Uniform Machine Declaration for Every Site Object
-
Learning Castle Portcullis Schema | Hard Stops and Protected Boundaries
-
Learning Castle Registry | Canonical Objects and Routes
-
Learning Castle Return Schema | Capability, Ownership and World Return
-
Learning Castle Route Schema | Gate Conditions and Typed Paths
-
Learning Castle Runtime Closure | Stable Castle Kernel
-
Learning Castle Scout Schema
-
Learning Castle Sentry Schema
-
Learning Castle State Schema | Learner, Routing and Evidence States
-
Learning Castle Supersession and Retirement Schema
-
Learning Castle Validation Schema | Runtime Integrity and Self-Checks
-
Learning Castle Watchtower Schema
-
Learning Castle | Logic Learning Gate System
-
Learning Drift | Marie Curie Series | Why a Student Can Look Fine Before Results Fall
-
Learning Hall | I Am Brave | Courage, Learning & eduKate Sengkang
-
Learning Practice and Review | Find Your Next Step
Browse every published Post
-
How to Learn Respiration and Gas Exchange: From Breathing to Cellular Bioenergetics
2–3 minutes -
How to Learn Spectroscopy: From Colour and Spectral Lines to Molecular Fingerprints and Stellar Physics
2–3 minutes -
How to Learn Reproduction and Development: From Life Cycles to Embryology and Developmental Biology
2–3 minutes -
How to Learn Chemical Bonding and Molecular Structure: From Attractions to Quantum Models and Materials
2–3 minutes -
How to Learn the Nervous System and Neural Signalling: From Reflexes to Neural Circuits and Coding
2–4 minutes -
How to Learn Rocks, Minerals and the Rock Cycle: From Earth Materials to Deep Time and Petrology
2–3 minutes -
How to Learn Microorganisms, Infection and Immunity: From Invisible Life to Host–Pathogen Systems
2–4 minutes -
How to Learn Enzymes and Metabolism: From Biological Catalysts to Metabolic Networks and Flux
2–3 minutes -
How to Learn Diffusion, Osmosis and Membrane Transport: From Random Molecular Motion to Electrochemical Gradients
2–3 minutes -
How to Learn Homeostasis and Feedback: From Body Balance to Control Systems and Systems Physiology
3–4 minutes -
How to Learn Gravity, Orbits and the Solar System: From Falling Objects to Orbital Mechanics
3–4 minutes -
How to Learn Radioactivity and Nuclear Decay: From Unstable Nuclei to Half-Life, Risk and Detection
2–3 minutes -
How to Learn Evolution and Natural Selection: From Variation to Population Genetics and Phylogeny
2–3 minutes -
How to Learn Pressure and Fluids: From Everyday Forces to Fluid Dynamics
3–4 minutes -
How to Learn Plate Tectonics and Earth Systems: From Moving Plates to a Dynamic Planet
3–4 minutes -
How to Learn Magnetism and Electromagnetism: From Magnets to Fields, Motors and Induction
3–4 minutes -
How to Learn Acids, Bases and pH: From Indicators to Equilibria and Buffer Systems
2–4 minutes -
How to Learn Weather and Climate: From Daily Observations to Atmospheric Science
3–5 minutes -
How to Learn Genetics and Inheritance: From Traits to Genes, Genomes and Variation
3–4 minutes -
How to Learn Photosynthesis and Respiration: From Plant Food to Cellular Energy Networks
3–4 minutes -
How to Learn Heat and Temperature: From Everyday Warmth to Thermal Physics
4–5 minutes -
How to Learn Linear Programming Algorithms: Feasible Regions, Simplex, Duality and Numerical Reality
7–10 minutes -
How to Learn the Fast Fourier Transform: DFT Structure, Divide-and-Conquer, Butterflies and Convolution
5–8 minutes -
How to Learn Bipartite Matching Algorithms: Augmenting Paths, Hopcroft–Karp and Assignment
5–8 minutes -
How to Learn Data Compression Algorithms: Entropy, Huffman Coding, Lempel–Ziv and Real-World Trade-Offs
5–8 minutes -
How to Learn Cache-Efficient Algorithms: Locality, I/O Complexity, Blocking and Cache-Oblivious Design
6–9 minutes -
How to Learn Parameterized Algorithms: FPT, Branching, Kernelization and Choosing the Right Parameter
6–9 minutes -
How to Learn NP-Completeness and Reductions: Certificates, Polynomial Time, Hardness and Proof Design
6–9 minutes -
How to Learn Number-Theoretic Algorithms: GCD, Extended Euclid, Modular Exponentiation and Primality
6–8 minutes -
How to Learn Parallel Algorithms: Work, Span, Reduce, Scan and When More Processors Actually Help
5–8 minutes -
How to Learn Suffix Arrays and LCP Arrays: String Indexing, Binary Search and Repeated Structure
5–7 minutes -
How to Learn Computational Geometry Algorithms: Orientation, Convex Hulls, Sweep Lines and Robust Predicates
5–7 minutes -
How to Learn Bloom Filters: Probabilistic Membership, False Positives and Space–Accuracy Trade-Offs
5–7 minutes -
How to Learn Cells and Living Systems: Beginner to Advanced
5–8 minutes -
How to Learn Forces and Motion: Beginner to Advanced
5–7 minutes -
How to Learn Matter and Particles: Beginner to Advanced
4–6 minutes -
How to Learn Energy in Science: Beginner to Advanced
4–7 minutes -
How to Learn Streaming Algorithms: One Pass, Small Memory and Approximate Answers
5–8 minutes -
How to Learn Online Algorithms: Decisions Without Future Knowledge and Competitive Analysis
5–8 minutes -
How to Learn Approximation Algorithms: Near-Optimal Solutions, Approximation Ratios and Proofs
5–7 minutes -
How to Learn Algorithm Correctness Proofs: Preconditions, Loop Invariants, Induction and Termination
5–7 minutes -
How to Learn Amortized Analysis: Aggregate, Accounting and Potential Methods
5–7 minutes -
How to Learn Randomized Algorithms: Random Choices, Expected Cost, Las Vegas and Monte Carlo Guarantees
4–7 minutes -
How to Learn Strongly Connected Components: Mutual Reachability, Kosaraju, Tarjan and Condensation DAGs
5–7 minutes -
How to Learn Selection Algorithms: Quickselect, Order Statistics and Median-of-Medians
5–7 minutes -
How to Learn Network Flow Algorithms: Residual Graphs, Augmenting Paths and Max-Flow Min-Cut
5–7 minutes -
How to Learn Minimum Spanning Trees: Cut Property, Kruskal, Prim and Proof of Choice
4–7 minutes -
How to Learn Topological Sorting: DAGs, Indegrees, Kahn’s Algorithm and Cycle Detection
4–6 minutes -
How to Learn Tries: Prefix Trees, Search, Autocomplete and Memory Trade-Offs
4–7 minutes -
How to Learn Backtracking Algorithms: Choose, Explore, Undo and Prune
7–10 minutes
Routing rule: use this fallback only for discovery and orphan control. Canonical subject ownership, reader pathways and return logic continue to come from the Learning Castle, subject hubs and Complete Archives.
