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
-
100 Primary English Tips Rebuilt as 10 Language Capabilities | Darwin × Voyage
-
100 Primary Mathematics Tips Rebuilt as 10 Capabilities | Darwin × Voyage
-
100 Primary Science Tips Rebuilt as 10 Scientific Capabilities | Darwin × Voyage
-
7 Mathematics Strategies That Survive Unfamiliar Questions
-
A Capability Profile Without Labelling the Child | Evidence, Support Conditions and the Next Learning Move
-
A Workable Weekday Routine for P4 to P6: School, Rest, Screens, Study
-
Accessible Learning Tasks Without Silent Target Changes | Change Access, Preserve the Learning Goal
-
Accessible Learning Tasks Without Silent Target Changes | Preserve the Learning Goal While Changing Access
-
Additional Mathematics Challenging Questions | An Advanced Worked Workshop
-
Additional Mathematics Classroom | Chapter 10: Differentiation — Gradient Functions, Power/Product/Quotient/Chain Rules, Tangents, Normals and Rates | SEC G2 K232 / G3 K341
-
Additional Mathematics Classroom | Chapter 11: Further Applications of Differentiation — Increasing/Decreasing Functions, Stationary Points, First/Second Derivative Tests and Optimisation | SEC G2 K232 / G3 K341
-
Additional Mathematics Classroom | Chapter 12: Differentiation of Trigonometric, Exponential and Logarithmic Functions — Advanced Chain Rule, Tangents, Rates and Optimisation | SEC G3 K341
-
Additional Mathematics Classroom | Chapter 13: Integration — Reverse Differentiation, Constants, Linear-Factor Integrals and G3 Trigonometric/Exponential/Logarithmic Extension | SEC G2 K232 / G3 K341
-
Additional Mathematics Classroom | Chapter 14: Applications of Integration — Definite Integrals, Signed Accumulation, Area Under Curves and Axis Crossings | SEC G2 K232 / G3 K341
-
Additional Mathematics Classroom | Chapter 15: Kinematics — Displacement, Velocity, Acceleration, Direction Changes, Total Distance and Motion Through Calculus | SEC G3 K341
-
Additional Mathematics Classroom | Chapter 1: Simultaneous Equations, Polynomials and Partial Fractions | SEC G2 K232 / G3 K341
-
Additional Mathematics Classroom | Chapter 2: Quadratic Functions, Discriminants, Inequalities and Line–Curve Conditions | SEC G2 K232 / G3 K341
-
Additional Mathematics Classroom | Chapter 3: Binomial Theorem, General Terms and Coefficient Reasoning | SEC G3 K341
-
Additional Mathematics Classroom | Chapter 4: Surds, Exact Algebra and Rationalising Denominators | SEC G2 K232 / G3 K341
-
Additional Mathematics Classroom | Chapter 5: Exponential and Logarithmic Functions, Laws, Equations, Graphs and Models | SEC G3 K341
-
Additional Mathematics Classroom | Chapter 6: Coordinate Geometry in Two Dimensions — Lines, Midpoints, Rectilinear Areas and Circles | SEC G2 K232 / G3 K341
-
Additional Mathematics Classroom | Chapter 7: Linear Law, Straight-Line Transformations, Parameter Recovery and Model Testing | SEC G3 K341
-
Additional Mathematics Classroom | Chapter 8: Trigonometric Functions, Graphs, Identities, Formulae and Equations | SEC G2 K232 / G3 K341
-
Additional Mathematics Classroom | Chapter 9: Proofs in Plane Geometry — Parallel Lines, Congruence, Similarity, Midpoint and Tangent–Chord Reasoning | SEC G3 K341
-
Additional Mathematics Classroom | Complete Chapter-by-Chapter SEC 2027 Route | G2 K232 / G3 K341
-
Additional Mathematics Learning Hub | Secondary 3–4 A-Math Guides
-
Additional Mathematics Strategies | Build the Algebra Route Before Speed
-
Additional Mathematics Study Guide | SEC G2 & G3, Topics and Worked Examples
-
Additional Mathematics Tuition Punggol | Secondary 3–4 A-Math | The Voyage Series
-
Additional Mathematics Tuition Sengkang | S3–S4 Learning System
-
Additional Mathematics Word Problems | Worked Examples from Situations to Equations and Calculus
-
Algorithms & Computing Hub | From First Principles to Professional Systems
-
Algorithms Learning Roadmap | Trace, Reconstruct, Design and Evaluate
-
Algorithms Quartermaster | Methods, Tools and Representations Agent
-
Alicia’s First Secondary 1 Report
-
Anchor Green Primary School: A Parent’s Learning Guide
-
Anomaly | When Learning Behaves Differently Than Expected
-
Archivist | Index, Enumeration and Orphan-Control Agent
-
Arrival State | What Has Actually Arrived at the Tutorial?
-
Assembly and Configuration | Putting the Right Supports Around the Learner
-
Baseline Before Intervention | Marie Curie Series | What Could the Learner Do Before We Changed Anything?
-
Beatrice’s PSLE Week
-
Becoming a Private Tutor in Singapore | Professional, Business, Tax, Privacy and Home-Tuition Responsibilities
-
Before the First Tuition Lesson in Sengkang | What Parents Should Prepare
-
Biochemistry, Metabolism & Molecular Homeostasis | Cofactors, Metals, Lipids and Flux
-
Biology & Living Systems | Cells, Organisms, Structure and Function
-
Bridgekeeper | Cross-Fort Handoff Agent
-
Cape Canaveral Series | The Learning Place Where Preparation Becomes Independent Motion
-
Career & Workplace Literacy Tutor | Curie Series | Understanding How Work Systems Change
-
Career Change & Reinvention Tutor | Curie Series | Moving Capability Into a New Field
Browse every published Post
-
Link–Cut Trees | Dynamic Forests Learning Guide
8–13 minutes -
How to Learn Seam Carving: Energy Maps, Dynamic Programming, Minimal Seams and Content-Aware Resizing
7–10 minutes -
How to Learn Duval’s Algorithm: Lyndon Words, Factorization, Three Pointers and Linear-Time String Structure
6–9 minutes -
How to Learn Fortune’s Algorithm: Voronoi Diagrams, Beach Lines, Site/Circle Events and Robust Sweep Geometry
7–10 minutes -
How to Learn the Auction Algorithm: Bids, Prices, ε-Complementary Slackness, Scaling and Parallel Assignment
7–11 minutes -
How to Learn Modern Timsort and Powersort: Natural Runs, Stable Merging, Galloping and Adaptive Merge Scheduling
8–12 minutes -
How to Learn Asymmetric Numeral Systems: Entropy States, rANS/tANS, Renormalization and Finite-State Compression
7–11 minutes -
How to Learn Δ-Stepping: Distance Buckets, Light/Heavy Edges, Parallel Relaxation and Shortest-Path Throughput
7–10 minutes -
D* Lite | Incremental Replanning Learning Guide
7–11 minutes -
How to Learn the Ramer–Douglas–Peucker Algorithm: Polyline Simplification, Perpendicular Distance, Recursion and Error Tolerance
6–9 minutes -
How to Learn the Knuth–Plass Line-Breaking Algorithm: Boxes, Glue, Penalties, Demerits and Paragraph-Wide Optimization
6–10 minutes -
How to Learn Floyd–Steinberg Dithering: Quantization Error, Error Diffusion, Scan Order and Image Quality
5–8 minutes -
How to Learn the Bron–Kerbosch Algorithm: Maximal Cliques, Candidate Sets, Pivoting and Degeneracy Ordering
6–9 minutes -
How to Learn Fibrosis and Tissue Scarring: From Wound Repair to Myofibroblasts, Matrix Stiffness and Organ Failure
4–6 minutes -
How to Learn Myelin and Saltatory Conduction: From Oligodendrocytes to Adaptive White Matter and Remyelination
4–7 minutes -
How to Learn Extracellular Vesicles and Exosomes: From Membrane Budding to Intercellular Cargo and Biomarkers
4–6 minutes -
How to Learn Cellular Senescence: From Cell-Cycle Arrest to SASP, Immune Clearance and Ageing
5–7 minutes -
How to Learn Christofides’ Algorithm: Metric TSP, Minimum Spanning Trees, Odd-Vertex Matching and the 3/2 Approximation
7–11 minutes -
How to Learn Buchberger’s Algorithm: Polynomial Division, S-Polynomials, Gröbner Bases and Critical-Pair Control
7–10 minutes -
Schreier–Sims Algorithm | Permutation Groups Learning Guide
7–10 minutes -
How to Learn Pollard’s Rho Factorization: Modular Iteration, Birthday Collisions, GCD Extraction and Brent Cycle Detection
7–10 minutes -
How to Learn Minimum Cycle Basis Algorithms: Cycle Spaces, Horton Candidates, Shortest Paths and GF(2) Independence
7–11 minutes -
How to Learn Knuth DP Optimization: Interval Recurrences, Monotone Split Points and Quadrangle Inequalities
4–5 minutes -
How to Learn Convex Hull Algorithms: Orientation Tests, Graham Scan, Monotone Chain and Robust Geometry
3–5 minutes -
How to Learn Eppstein’s K-Shortest-Paths Algorithm: Shortest-Path Trees, Sidetrack Costs, Persistent Heaps and Path Enumeration
7–11 minutes -
How to Learn Patricia Tries and Radix Trees: Path Compression, Bitwise Branching and Longest-Prefix Search
3–4 minutes -
How to Learn Radix Heaps: Monotone Keys, Bit Buckets, Redistribution and Integer-Weight Dijkstra
7–10 minutes -
How to Learn Pairing Heaps: Meld, Two-Pass Delete-Min, Decrease-Key and Amortized Reasoning
4–6 minutes -
How to Learn Myers’ Diff Algorithm: Edit Graphs, D-Paths, Shortest Edit Scripts and Linear-Space Reconstruction
7–10 minutes -
How to Learn Freivalds’ Algorithm: Random Projections, Matrix Product Verification and One-Sided Error Guarantees
5–8 minutes -
How to Learn the Fast Walsh–Hadamard Transform: Butterfly Operations, XOR Convolution and O(n log n) Structure
5–7 minutes -
How to Learn Luby’s Algorithm: Maximal Independent Sets, Random Priorities, Parallel Rounds and High-Probability Progress
5–7 minutes -
Bostan–Mori Algorithm | Fast Linear Recurrences Learning Guide
5–8 minutes -
How to Learn Minimum Mean-Cycle Algorithms: Average Cycle Weight, Karp’s Dynamic Programming, Negative Cycles and Systems Analysis
7–10 minutes -
How to Learn GJK Collision Detection: Minkowski Difference, Support Mappings, Simplexes and Robust Convex Geometry
7–10 minutes -
How to Learn Tonelli–Shanks: Quadratic Residues, Modular Square Roots, Euler’s Criterion and Finite-Field Reasoning
5–8 minutes -
How to Learn the Four Russians Technique: Block Decomposition, Lookup Tables, Boolean Matrix Multiplication and Word-Level Speedups
6–8 minutes -
How to Learn X-Ray Photoelectron Spectroscopy and Surface Analysis: From the Photoelectric Effect to Chemical States, Depth Profiles and Operando Interfaces
10–15 minutes -
How to Learn Cryo-Electron Microscopy and Single-Particle Reconstruction: From Vitrified Samples to CTF, 3D Maps and Structural Validation
10–15 minutes -
How to Learn Mitochondria and Mitochondrial Dynamics: From ATP and Membrane Potential to Fusion, Fission, Mitophagy and Heteroplasmy
10–15 minutes -
How to Learn Microfluidics and Lab-on-a-Chip Science: From Laminar Flow and Diffusion to Droplets, Organ-on-Chip and Autonomous Microsystems
10–15 minutes -
How to Learn Knuth Optimization: Interval Dynamic Programming, Monotone Split Points, Quadrangle Inequalities and O(n²) Speedups
7–11 minutes -
How to Learn Marching Cubes: Isosurfaces, Case Tables, Interpolation, Topology and Production Mesh Extraction
8–11 minutes -
How to Learn CORDIC: Shift–Add Rotations, Vectoring, Fixed-Point Arithmetic and Hardware Trigonometry
6–10 minutes -
How to Learn the Bentley–Ottmann Algorithm: Sweep Lines, Event Queues, Segment Intersections and Robust Geometry
7–11 minutes -
How to Learn Optogenetics and Causal Neuroscience: From Opsins and Light Pulses to Circuit Perturbation, Wireless Implants and Causal Inference
9–14 minutes -
How to Learn Neutron Scattering and Neutron Imaging: From Nuclear Scattering to Diffraction, Dynamics and Operando Materials Science
9–14 minutes -
How to Learn Mechanochemistry and Solid-State Reactivity: From Grinding and Defects to Ball Milling, Liquid-Assisted Grinding and Mechanocatalysis
9–13 minutes -
How to Learn Flow Cytometry and Cell Sorting: From Light Scatter and Fluorescence to Gating, Spectral Unmixing and Single-Cell Decisions
8–12 minutes -
How to Learn Cilia, Flagella and Cell Motility: From Microtubules and Dynein to Fluid Flow and Cellular Signalling
4–7 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.
