CS Fundamentals

A connected route from foundations to production systems: 3 stages and about 40 hours, including practice and projects. Learn, practise, and prove each stage.

Set a target
Your progress0 of 11 topics
Current stageExecution

Stage 1 of 3

Your paceNot set

Set a target on the planner

Take the placement check (10 min)

Draft. This path has not been reviewed by a second person yet. Topic order, estimates and tasks may change.

Arrows run from a prerequisite to what it unlocks. Select a topic to open it.
Filled: doneHeavy outline: in progressDashed: waiting on a prerequisiteDotted: skipped

The list view has the same topics and works with any screen reader.

  1. Stage 1: Execution

    2 topics · 12 h · milestone: Inspect a process tree and explain how an I/O-bound request waits0 / 2
    Stage project and rubric

    Inspect a process tree and explain how an I/O-bound request waits. Identify its memory and file resources.

    Use your own small service or a disposable local example. Score each criterion: 0 missing, 1 partial, 2 demonstrated.

    • You show the process tree and which process handles the request, with evidence.
    • You explain where an I/O-bound request spends its time while it waits, and how you know.
    • You list the process's memory and open files, and explain one that surprised you.

    Target: 2 on every criterion. Record your evidence in the notes of the stage's last topic. Report a problem with this project.

  2. Stage 2: Communication

    3 topics · 12 h · milestone: Annotate a request trace0 / 3
    Stage project and rubric

    Annotate a request trace. Identify where DNS, transport and HTTP can fail independently.

    Use your own small service or a disposable local example. Score each criterion: 0 missing, 1 partial, 2 demonstrated.

    • The trace is annotated hop by hop: name lookup, connection, TLS, request and response.
    • You show one failure each for DNS, transport and HTTP, and what each looks like to the client.
    • You explain where scheduling, buffering or loss would add delay under load, and how to see it.

    Target: 2 on every criterion. Record your evidence in the notes of the stage's last topic. Report a problem with this project.

  3. Stage 3: Persistent state

    6 topics · 16 h · milestone: Build an indexed order lookup0 / 6
    Stage project and rubric

    Build an indexed order lookup. Explain the disk access and what another transaction can observe.

    Use your own small service or a disposable local example. Score each criterion: 0 missing, 1 partial, 2 demonstrated.

    • The lookup uses an index, shown in its plan, and you explain the pages it reads.
    • You explain what a concurrent transaction sees before and after the write commits.
    • You show what the write-ahead log protects and what it does not.

    Target: 2 on every criterion. Record your evidence in the notes of the stage's last topic. Report a problem with this project.

Source inventory and coverage

11 topics map to 26 unique activities. Shared resources count once. Every topic has a self-check; every stage has a project rubric.

Supplementary pages kept outside this path:

Pages under Library and Practice come from, or build on, Donne Martin's System Design Primer (CC BY 4.0).

Esc
↑ ↓ to move↵ to open