Skip to main content

Semester 00 Workload and Progression

Plan 210–309 focused hours, excluding conditional Launchpad repairs. These are author estimates awaiting learner pilots. At 10 hours/week, allow roughly 21–31 weeks; at 20, 11–16. Peer scheduling, the four-week retention interval and repeated repairs can extend calendar time. The old five-week arc is an ordering scaffold, not a completion promise.

Non-overlapping allocation​

  • Programming Basics: 38–57 hours, including the original tracker, reading-page transfer, two design/diagnosis lessons, clinic and initial module assessment.
  • Algorithm Intuition: 30–45 hours — concepts/selected reading 10–15; traces, practice and labs 14–21; quiz, feedback and repair 6–9.
  • CS Fundamentals: 25–35 hours — concepts/selected reading 9–12; computing maps, scenarios and labs 10–15; quiz, feedback and repair 6–8.
  • Code Readability: 25–35 hours — concepts/selected reading 8–11; test-protected changes and labs 11–16; quiz, feedback and repair 6–8.
  • Learning, Memory and Calibration: 8–12 hours — lessons 2–3; lab/process analysis 4–6; assessment and one repair 2–3.
  • Data, Files and Automation: 14–20 hours — lessons 4–6; cluster practice 3–4; implementation/checks 5–7; assessment/repair 2–3.
  • The Web, HTTP and APIs: 16–24 hours — lessons 5–7; cluster practice 3–5; implementation/local exchange 6–9; assessment/repair 2–3.
  • AI Literacy and Assisted Engineering: 12–18 hours — lessons 4–6; assistance practice 2–3; evaluator lab 4–6; assessment/repair 2–3.
  • Programming retention checks: 2–3 hours across the seven-day and four-week checks, including one bounded repair.
  • Mathematical-notation bridge: 2–3 hours, including its exit gate.
  • Responsible AI, ethics, privacy and accessibility strand: 12–18 hours — 3–4 each for assistance verification and ethical reasoning, 2–4 for privacy inventory, 4–6 for keyboard/tooling checks and repair.
  • Semester integration: 26–39 hours — Algorithm Explorer assembly and end-to-end verification 14–20; checkpoint 2–3; exam and oral follow-up 3–4; cumulative review 3–5; one bounded semester repair 4–7.

Original technical modules total 118–172; new technical practice adds 42–62; learning calibration adds 8–12 (all modules 168–246); retention/notation add 4–6; strand adds 12–18; integration adds 26–39: 210–309. The 42–63-hour programming/retention/notation bridge is already inside this total. Do not add it again.

The learning-support integration route specifies evidence reuse and scheduling. These 8–12 hours cover learning-method instruction, process analysis and practice; existing technical attempts and retention sessions are charged only to their original allocations. Full-book courses and the optional Module 0 extra drills remain outside the required total.

The technical practice route adds three distinct lab contracts in one shared download. Reuse Git and AI/privacy records; do not double-count their existing strand work. Module 6 requires an actual local HTTP exchange; restricted networking leaves that gate pending. Module 7 permits a clearly labeled offline AI-workflow/evaluation route with authored fixtures.

Reuse and scope​

Use module traces and tested functions inside Algorithm Explorer. Module hours cover learning and local exercises; integration covers connecting components, saved scenarios, clean setup and cross-module checks. Reuse one evidence packet and one strand log, recording each claim independently. The project may be a terminal interface with step-by-step state; a GUI and an additional web framework are optional. The optional Wordle extension and complete external courses are excluded.

Retain all existing project behavior, explanatory and testing requirements. A quick-start time is a diagnostic target, not a speed gate. A fresh user should be able to follow declared prerequisites and reproduce expected results; record setup blockers and repairs honestly.

Progression sequence​

  1. Pass Launchpad computer/arithmetic/reading and core requirements; schedule any remaining algebra repair.
  2. Complete Programming Basics and its immediate rubric. Provisional continuation into Algorithm Intuition is allowed while delayed checks are not yet due.
  3. Interleave technical Modules 5–7 after their prerequisites using the technical route. Study algorithm intuition, CS fundamentals and readability; construct the integrated project and strand evidence. Start Module 4 alongside programming. Reuse the Launchpad capacity plan, source-audit method and communication record within existing work; their original 17–26 hours have moved to Launchpad.
  4. Close programming retention checks, algebra repair and notation before final advancement to Semester 01. A not-yet-due check is pending, not failed. A failed check requires targeted repair and a fresh variant.

One exit rule​

All five Programming Basics dimensions must score 2/2, including clinic evidence and closed delayed checks. Additionally require checkpoint ≥80% with no critical missing outcome; exam ≥70% overall and ≥60% in each major section; all required project deliverables; every strand category; notation/algebra readiness; integrity; and the inherited Launchpad preparation gates and current learning-calibration dimensions L1–L3 at 2/2; plus DF1–DF4, WH1–WH4 and AI1–AI4 at 2/2. Existing stricter task-specific requirements still apply. A conditional pass does not authorize advancement.

For consistent scoring, the four exam parts A–D each contribute 25% of the exam score. Score each part on a 0–100 scale using its answer-key guidance, then average them. The separate strand defense and programming gates cannot be averaged into these scores to compensate for failure. Weights are a clarified assessment design, not validated psychometrics.

Example: exam sections 90/90/90/50 give 80% overall but fail the per-section floor. Sections 70/70/70/70 satisfy exam numbers, but an unclosed programming-retention check keeps semester readiness provisional.

Pilot record and remediation​

Use the programming pilot template for all modules: record active reading, implementation, investigation, assessment and repair minutes; keep waiting time separate. Mark reviewer status, assistance, confusing instructions and actual outcomes. Do not infer typical beginner hours from one learner.

If proof notation is weak, repair the bridge rather than repeat programming. If explanation is weak, trace a smaller unfamiliar case. If the project fails only during setup, fix the instructions/environment assumptions and rerun cleanly. Preserve old and repaired evidence. These are authoring contracts awaiting independent review and real learner calibration.