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 Articles and Determiners Control Specificity, Shared Knowledge and Reference | English Tuition Sengkang
-
How Assessment Evidence Works | What a Test Can Tell Us—and What It Cannot
-
How Assumptions Define the Limits of Mathematical Models | Mathematics Tuition Sengkang
-
How Attention Works in Learning | Selection, Control and the Cost of Distraction
-
How Author Purpose Shapes Language, Evidence and Structure | English Tuition Sengkang
-
How Automaticity Works in Learning | When Accurate Basics Become Fast Enough to Free Thinking
-
How Boundary and Extreme Cases Test Mathematical Claims | Mathematics Tuition Sengkang
-
How Bounds and Intervals Help Students Reason About Approximate Values | Mathematics Tuition Sengkang
-
How Calibration and Reference Standards Make Scientific Measurements Comparable | Science Tuition Sengkang
-
How Can Parents Help Without Becoming the Second Tutor?
-
How Can Parents Tell Whether Tuition Is Building Independence?
-
How Can Three Students Share a Class Without Receiving the Same Teaching?
-
How Causative Verbs Show Who Makes, Lets, Helps or Arranges for an Action to Happen | English Learning Guide
-
How Character Motivation Turns Actions Into Interpretation | English Tuition Sengkang
-
How Chunking Works in Learning | Turn Many Elements Into Meaningful Units Without Hiding the Structure
-
How Classification Builds Scientific Thinking | From Characteristics to Groups and Keys | Science Tuition Sengkang
-
How Cognitive Fatigue Works in Learning | When Mental Effort Changes Performance and What to Do Next
-
How Cognitive Flexibility Works in Learning | Switching Perspectives, Updating Models and Choosing a Better Route
-
How Cognitive Load Works in Learning | Working Memory, Knowledge, Guidance and Productive Challenge
-
How Cognitive Offloading Works in Learning | Use External Tools Without Outsourcing the Learning
-
How Cohesion Holds Sentences and Paragraphs Together | English Tuition Sengkang
-
How Collocation Turns Vocabulary Knowledge Into Natural, Precise English | English Tuition Sengkang
-
How Comparative and Superlative Forms Build Fair, Precise Comparisons | English Tuition Sengkang
-
How Comparison Turns Two Texts Into Analytical Judgement | English Tuition Sengkang
-
How Comparison Works in Learning | Align Cases, Find the Difference That Matters and Choose Better
-
How Compound Nouns Turn Two Familiar Words Into One New Concept | English Learning Guide
-
How Comprehension Works for a Student | Building Meaning, Testing Inference and Proving the Answer
-
How Concentration and Total Amount Describe Different Scientific Quantities | Science Tuition Sengkang
-
How Concept Boundaries Work in Learning | Knowing What Belongs, What Does Not and Why
-
How Concept Mapping Works in Learning | Make Relationships Visible Without Turning the Map Into Decoration
-
How Conceptual Change Works in Learning | Replacing Plausible Wrong Models With Better Ones
-
How Concession Uses Although, Even Though and Despite to Hold Competing Ideas Together | English Tuition Sengkang
-
How Concrete Examples Work in Learning | Make an Abstract Idea Graspable Without Getting Trapped in the Example
-
How Conditional Language Builds If-Then Reasoning and Hypothetical Claims | English Tuition Sengkang
-
How Confidence Works in Learning | Belief, Evidence and Accurate Self-Trust
-
How Conflict and Tension Build Narrative Stakes, Pressure and Change | English Tuition Sengkang
-
How Connotation Changes Meaning Beyond Dictionary Definitions | English Tuition Sengkang
-
How Conservation Reasoning Helps Students Track Matter and Energy | Science Tuition Sengkang
-
How Consolidation Works in Learning | From Fragile New Learning to More Stable Memory
-
How Context Clues Build Vocabulary Independence | English Tuition Sengkang
-
How Coordination and Subordination Show Which Ideas Are Equal and Which Depend on Others | English Tuition Sengkang
-
How Countable and Uncountable Nouns Change Articles, Quantity and Meaning | English Learning Guide
-
How Counterarguments and Rebuttals Strengthen Analytical Writing | English Tuition Sengkang
-
How Counterexamples Test Broad Claims and Reveal Their Limits | English Tuition Sengkang
-
How Cramming Works in Learning | Why Massed Study Can Feel Strong Now and Fade Later
-
How Cumulative Effects Build Across Time in Science Systems | Science Tuition Sengkang
-
How Curiosity Works in Learning | Questions, Information Gaps, Exploration and Productive Attention
-
How Definitions and Criteria Shape Arguments Before Evidence Arrives | English Tuition Sengkang
-
How Deliberate Practice Works in Learning | Targeted Weakness, Feedback, Difficulty and Better Repetition
-
How Descriptive Writing Turns Observation Into Meaning | English Tuition Sengkang
Browse every published Post
-
How to Learn Redox Biology and Oxidative Stress: From Reactive Oxygen Species to Cysteine Signalling, Antioxidant Networks and Redox Proteomics
9–14 minutes -
How to Learn Spintronics and Magnetic Memory: From Electron Spin and Magnetoresistance to MRAM, Spin–Orbit Torque and Altermagnets
10–14 minutes -
How to Learn Bioreactors and Bioprocess Engineering: From Growth Kinetics and Oxygen Transfer to Scale-Up, Perfusion and Digital Twins
8–12 minutes -
How to Learn the Ricart–Agrawala Algorithm: Logical Clocks, Deferred Replies, Distributed Mutual Exclusion and Failure Handling
7–10 minutes -
How to Learn the Bully Leader-Election Algorithm: Failure Detection, Election Cascades, Coordinator Recovery and Split-Brain Limits
6–9 minutes -
How to Learn Lamport’s Bakery Algorithm: Tickets, Lexicographic Order, Mutual Exclusion, Fairness and Memory-Model Reasoning
6–9 minutes -
How to Learn the Gallager–Humblet–Spira (GHS) Algorithm: Fragments, Minimum Outgoing Edges, Levels, Message Passing and Distributed MSTs
8–11 minutes -
How to Learn Montgomery Reduction: Residue Representation, Division-Free Modular Multiplication, Radix Arithmetic and Production Cryptography
6–10 minutes -
How to Learn Bitonic Sorting Networks: Compare–Exchange Stages, Bitonic Merge, Parallel Depth and GPU/Hardware Thinking
7–10 minutes -
How to Learn Smoothsort: Leonardo Heaps, Adaptive In-Place Sorting, Heap Forests and Nearly Sorted Data
7–11 minutes -
How to Learn the Möller–Trumbore Algorithm: Ray–Triangle Intersection, Barycentric Coordinates, Determinants and Robust 3D Geometry
7–10 minutes -
How to Learn Ptychography and Coherent Diffraction Imaging: From Overlapping Diffraction Patterns and Phase Retrieval to 3D Nanostructure, Electron Ptychography and Computational Microscopy
8–13 minutes -
How to Learn Scanning Electrochemical Microscopy (SECM): From Ultramicroelectrode Feedback and Diffusion Fields to Local Reaction Kinetics, Battery Interfaces and Operando Electrocatalysis
8–13 minutes -
How to Learn Terahertz Time-Domain Spectroscopy (THz-TDS): From Ultrafast Pulses and Electric-Field Sampling to Complex Conductivity, Materials Imaging and On-Chip THz Metrology
8–12 minutes -
How to Learn Electron Backscatter Diffraction (EBSD): From Kikuchi Patterns and Crystal Orientation to Grain Boundaries, Strain Mapping and 4D Microstructure Analysis
10–15 minutes -
How to Learn Spectroscopic Ellipsometry and Thin-Film Optical Metrology: From Polarization Changes to Thickness, Optical Constants and In-Situ Growth
6–9 minutes -
How to Learn Quartz Crystal Microbalance with Dissipation (QCM-D): From Piezoelectric Resonance to Adsorbed Mass, Viscoelastic Films and Interfacial Kinetics
6–9 minutes -
How to Learn Dynamic Light Scattering and Zeta Potential: From Brownian Motion and Autocorrelation to Colloid Size, Stability and Electrophoretic Mobility
7–10 minutes -
How to Learn Havel–Hakimi: Degree Sequences, Graphicality, Greedy Realisation and Constructive Graph Theory
6–9 minutes -
How to Learn Time-of-Flight Secondary Ion Mass Spectrometry (ToF-SIMS): From Primary-Ion Bombardment to Molecular Surface Imaging, Depth Profiling and 3D Chemical Maps
8–11 minutes -
How to Learn Tarjan’s Offline LCA Algorithm: DFS, Union–Find, Ancestor Labels and Batched Tree Queries
7–10 minutes -
Sethi–Ullman Algorithm | Register Allocation Learning Guide
7–10 minutes -
How to Learn Floyd–Rivest Selection: Sampling, Bracketing, Partitioning and Near-Optimal Expected Comparisons
7–11 minutes -
How to Learn the Schorr–Waite Algorithm: Pointer Reversal, Constant-Space Graph Marking, Restoration and Garbage Collection
7–10 minutes -
How to Learn Dijkstra–Scholten Termination Detection: Diffusing Computations, Deficits, Acknowledgements and Global Quiescence
6–10 minutes -
How to Learn Pratt Parsing: Binding Power, Prefix/Infix Parselets, Precedence, Associativity and Expression Parsers
6–9 minutes -
How to Learn Welford’s Online Algorithm: Running Mean, Stable Variance, One-Pass Updates and Streaming Statistics
6–9 minutes -
Misra–Gries Algorithm | Heavy Hitters Learning Guide
6–9 minutes -
How to Learn the Z Algorithm: Prefix Matches, Z-Boxes, Linear-Time String Search and Periodicity
5–8 minutes -
How to Learn Hierholzer’s Algorithm: Euler Trails, Edge Consumption, Stack Splicing and Linear-Time Graph Traversal
6–9 minutes -
How to Learn Centroid Decomposition: Balanced Tree Separators, Centroid Trees, Distance Queries and Divide-and-Conquer
6–9 minutes -
How to Learn Held–Karp Dynamic Programming: Bitmask States, Exact TSP, Tour Reconstruction and Exponential-Time Engineering
7–11 minutes -
How to Learn LZW Compression: Dictionaries, Variable-Width Codes, Decoding Edge Cases and Legacy Format Engineering
8–11 minutes -
How to Learn Cuckoo Hashing: Two-Choice Placement, Displacement Chains, Cycles, Rehashing and Constant-Time Lookup
7–11 minutes -
How to Learn Johnson’s Algorithm: Reweighting, Bellman–Ford Potentials, Dijkstra and Sparse-Graph APSP
7–10 minutes -
How to Learn Bresenham’s Line Algorithm: Integer Error Terms, Octants, Rasterization and Robust Grid Traversal
6–10 minutes -
How to Learn Push–Relabel Maximum Flow: Preflows, Excess, Height Labels, Discharge and Global Relabeling
7–10 minutes -
How to Learn Hopscotch Hashing: Neighborhoods, Displacement, Bitmaps, Load Factors and Concurrent Table Design
7–11 minutes -
How to Learn Scapegoat Trees: α-Balance, Rebuilding, Size Bounds and Amortized Search-Tree Updates
7–10 minutes -
How to Learn Compensated Summation: Kahan, Neumaier, Floating-Point Error and Reproducible Reductions
7–10 minutes -
How to Learn B+ Trees: Fanout, Leaf Links, Page Splits, Merges and Database Index Engineering
8–11 minutes -
How to Learn RRT and RRT*: Configuration Spaces, Voronoi Bias, Rewiring and Asymptotically Optimal Motion Planning
8–12 minutes -
Kalman Filter | State Estimation Learning Guide
8–12 minutes -
How to Learn Earley Parsing: Chart States, Predictor–Scanner–Completer, Ambiguity and Context-Free Grammars
7–11 minutes -
How to Learn the Viterbi Algorithm: Trellises, Dynamic Programming, Backpointers, Log Probabilities and Sequence Decoding
6–10 minutes -
How to Learn Boyer–Moore Majority Vote: Pairwise Cancellation, Candidate Invariants, Verification and Streaming
5–8 minutes -
How to Learn Dinic’s Algorithm: Level Graphs, Blocking Flows, Current Arcs and Fast Max-Flow
7–10 minutes -
How to Learn Sutherland–Hodgman Polygon Clipping: Half-Planes, Edge Cases, Intersections and Convex Windows
8–12 minutes -
How to Learn Theta*: Any-Angle Pathfinding, Line-of-Sight Relaxation, Parent Rewiring and Grid Geometry
8–12 minutes -
How to Learn KLL Quantile Sketches: Compaction Levels, Rank Error, Mergeability and Streaming Percentiles
8–12 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.
