IB CS Hub

Already have access? Sign in →

IB CS Hub · IB Computer Science · 2027 syllabus · SL & HL

Everything you need to walk into the exam ready.

One payment. A full year of full-syllabus lesson decks, revision handouts, exam-style practice with answer keys, and a progress tracker — plus AI-powered exam prep, coaching & IA marking on pay-as-you-go credits.

Get 1-year access — $100 See a sample first

1 year, no subscription
·
<28¢ / day
·
card or crypto

Everything included

One access pass covers the full course — nothing is paywalled separately.

Lessons

Full syllabus slide decks

Every lesson in the SL & HL syllabus, 25–50+ slides each, with original explanations and worked Python examples.

Notes

Revision handouts

A printable reference summary per unit — key terms and definitions students copy down, ready to revise from.

Practice

Exam-style scenarios

Section A & B style questions in real IB command-term language, grouped by scenario — just like the specimen paper.

Marking

Full answer keys

Every practice question ships with a worked model answer — not just a final value, the reasoning that earns the marks.

Built in

Practice at the end of every deck

Each lesson closes with its own check-for-understanding section — no separate booklet to dig up.

AI Lab

AI question generator

Generate fresh practice questions on demand, whenever you need more. Runs on a separate wallet of AI credits, topped up as you go — not included in the $100 pass.

Tracked

Progress tracker

See topics completed, streaks, and flagged weak spots across every unit — all in one dashboard.

Full exam

Exam Prep, Study Coach & IA Marking

Generate full specimen-style papers with markschemes, run 1:1 study sessions, and get IA draft feedback. These AI tools are pay-as-you-go: each generation spends credits from your wallet, purchased separately.

Built for the mark, not just the content

The Exam Prep tools that actually move your score

Most of the marks students lose aren't from missing knowledge — they're from the wrong answer shape, the same command term tripping them up paper after paper, and never seeing exactly which sentence would have earned which mark. These five tools target that directly.

Mark-scheme DNA

See every mark, not just the score

Every exam answer comes back broken into its individual marking points — each one flagged hit or missed — instead of a single vague comment.

Predicted paper

Weighted to your actual weak spots

One toggle concentrates the next paper's higher-mark questions on the topics and command terms your own history shows you lose the most marks on.

Command Term Drill

Train the verb, not just the topic

Quick, content-easy drills marked purely on whether your answer's shape fits State, Explain, Evaluate and more — isolates the habit that's actually costing marks.

Live while you write

A live read on your answer as you type

A running structural signal under every answer box in a live paper — so you catch a thin or off-shape answer before you submit, not after.

Examiner mode

See the full-mark version of your own answer

One click rewrites your answer at full marks and calls out exactly what changed — structure, precision, terminology — so the gap is concrete, not abstract.

All five, in every Exam Prep attempt

No separate unlock — they come with every paper you generate on your AI credit wallet.

Plus quick-fire practice & revision activities

Flashcards, multiple-choice quizzes, code tracing, spot-the-bug, self-marked exam answers, command-term practice and timed drills — for fast revision alongside the full decks.

See it before you buy

One real lesson, "Recursion — Functions Calling Themselves", shown in full below.

Sample slide deck

slide 6 of 38

4.2 · Recursion

A function that calls itself needs a way to stop

Every recursive function needs a base case — a condition where it returns directly instead of calling itself again. Without one, the calls never stop and Python raises a RecursionError.

def factorial(n):
if n == 0:             # base case
return 1
# recursive case:
return n * factorial(n - 1)

Sample handout

Recursion — key terms

Base case — the condition under which a recursive function stops calling itself and returns a value directly.

Recursive case — the part of the function that calls itself with a smaller or simpler input, moving toward the base case.

Call stack — where Python stores each paused function call while it waits for the recursive call beneath it to return.

Continue reading with full access →

Sample practice scenario & answer key

Question 3 [4 marks]

A student writes a recursive function to reverse a string but forgets to include a base case.

Identify what will happen when the function is called, and outline the fix.

Model answer — mark scheme

Without a base case the function keeps calling itself with a shrinking string until Python's maximum recursion depth is exceeded, raising a RecursionError. Add a check such as if len(s) == 0: return s before the recursive call.

🔒

Unlocks with full access

IB CS Hub · 2027 syllabus

Ready when you are

One-time payment unlocks the entire course for 1 year — that's under 28¢ a day. Access is granted automatically to the email below once your payment confirms — usually within a few minutes.

✓

Every lesson deck, note and practice set — full syllabus, SL & HL.

✓

Answer keys for every question — worked, not just final values.

✓

Progress tracker — plus Exam Prep, Study Coach & IA Marking, powered by pay-as-you-go AI credits (topped up separately).

✓

1 year of access — one payment, no subscription.

Pay by card or crypto (NOWPayments, 150+ coins incl. USDT) · access granted automatically, no manual review.

Welcome back

Sign in

Email Password

Reset your password

Forgot password

$100 · 1 year access · <28¢/day