What's inside · IB Computer Science 2027 syllabus · SL & HL

The whole course, opened up.

No teaser screenshots. Below are four complete, unlocked resources — a full lesson deck, its handout, a revision booklet page and an IA guide — followed by exactly what the rest of the library contains, unit by unit.

Open the free samples See syllabus coverage

Four resources, free and complete

These are real files from the library, not cut-down demos. Open them, teach from them, print them.

Full lesson deck

20 slides · free

Recursion — a full sample lesson

Objectives mapped to B2.4.4–B2.4.5, the base and recursive cases explained in full, a worked Python factorial example, a hand trace, the call-stack mechanism, a student task with worked answer, an exam question with its mark scheme, and a three-question practice section with full model answers.

Open the deck →

Matching handout

printable

Recursion — printable handout

The same lesson as a paper resource: key terms and definitions to copy down, annotated code, blank trace tables to fill in during the dry runs, and practice questions with space to work. Every lesson in the library has one.

Open the handout →

Unit revision booklet

one per unit

Revision booklet — sample page

What students revise from in the fortnight before a paper: condensed definitions for the whole unit, a worked example per concept, and exam-style questions with model answers underneath.

Open the booklet →

IA support

criteria A–E

IA guide — sample section

The internal assessment broken down criterion by criterion: what each one actually rewards, the evidence a moderator looks for, common ways students lose marks, and a suggested timeline from proposal to final submission.

Open the IA guide →

Anatomy of a lesson

Every deck follows the same teaching structure

Decks run 25–50+ slides, written so the explanation is on the slide itself — a teacher can pick one up cold and teach directly from it, and a student who missed the lesson can read it and still understand.

01 · Objectives

Mapped to syllabus codes

Each lesson opens with what students will be able to do, stated against the exact syllabus reference (A2.1.3, B2.4.5…) so coverage is auditable against the subject guide.

02 · Concept

Full mechanism, not a definition

Concept slides walk through what something is, how it works step by step, and why it matters — written for a student with no prior knowledge reading it alone.

03 · Code

Worked Python examples

Syntax-highlighted, commented Python for every concept — original examples written for this course, ready to live-code or paste into an editor with the class.

04 · Trace

Dry runs and trace tables

Row-by-row trace tables showing how variables change per iteration or per call — the skill Paper 1 tests directly, and the one students most often lose marks on.

05 · Pitfalls

Common mistakes & debugging

The specific errors students make on this topic, what the resulting behaviour looks like, and how to fix it — so misconceptions get named in the lesson rather than in the exam.

06 · Practice

Your-turn tasks in class

Built-in student activities part-way through the deck — trace this, predict the output, write the function — each with a worked solution slide following it.

07 · Exam

Exam question, then mark scheme

Questions in real IB command-term language (state, describe, outline, construct, evaluate) with the model answer on the next slide, so you can set it live and reveal after.

08 · Notes

Student note-taking slides

A clean reference summary at the end of each major section — key terms and definitions students copy straight into their notes, plus a glossary recap closing every deck.

09 · Delivery

Speaker notes & PDF export

Every slide carries a teaching cue — what to emphasise, a question to ask, timing. Present full-screen, or export the whole deck to PDF for cover lessons and printing.

Coverage

Every unit of the 2027 syllabus, SL and HL

Close to 100 lessons across both themes plus the case study. Each unit ships the same bundle: lesson decks, matching handouts, a revision booklet, and exam-style practice with answer keys. HL-only content is flagged so SL classes can skip it cleanly.

A1 · 15 lessons

Computer fundamentals

Hardware, memory hierarchy, the fetch–decode–execute cycle, operating systems, binary and hexadecimal, logic gates and truth tables.

A2 · 11 lessons

Networks

Network types and topologies, protocols and layered models, addressing, transmission media, security threats and mitigation, VPNs and the cloud.

A3 · 18 lessons

Databases

Relational design, keys and relationships, normalisation, SQL queries, transactions and integrity, plus HL distributed and NoSQL databases.

A4 · 14 lessons

Machine learning

Supervised and unsupervised learning, training data and bias, neural networks, evaluation metrics, and the ethical questions the syllabus expects students to argue.

B1 · 4 lessons

Computational thinking

Decomposition, abstraction, pattern recognition and algorithmic thinking — the framing students reuse across every programming question.

B2 · 14 lessons

Programming

Python from first output through numeric and string types, lists, selection and iteration, functions, exception handling and file processing, plus stacks, queues, searching, sorting and Big O.

B3 · 10 lessons

Object-oriented programming

Classes and objects, encapsulation, inheritance and polymorphism, UML class diagrams, and designing an object model from a written scenario.

B4 · 6 lessons

Abstract data structures

Stacks, queues, linked lists, trees and graphs — operations, Python implementations, and when each structure is the right choice.

Case study · 7 lessons · HL

The HL case study, taught properly

Dedicated lessons unpacking the released case study: the underlying technologies explained from scratch, the terminology students are expected to use, extended-response practice in the style of the paper, and a vocabulary reference for the whole scenario.

Practice & assessment

Questions that look like the paper, answers that show the marks

Every question in the library ships with a worked model answer — not a final value, but the reasoning that earns each mark, written the way a mark scheme awards it.

Question · as it appears

Question 4 [4 marks]

A queue is used to hold print jobs waiting for a shared office printer.

Describe why a queue is a more suitable abstract data structure than a stack for this task.

Model answer · unlocked here

A queue operates first-in-first-out, so the job submitted earliest is printed first (1). This matches the expected real-world behaviour of a shared printer, where users assume fairness by order of arrival (1).

A stack operates last-in-first-out, so the most recently submitted job would print first (1), meaning an early job could be delayed indefinitely while new jobs keep arriving — a starvation problem (1).

AI tools · pay-as-you-go credits

Five tools that adapt the course to the student in front of you

The library is fixed; these are not. Each tool generates material against the actual syllabus and the student's own record of weak topics. They run on a separate credit wallet, topped up when you need it.

Question generator

Unlimited fresh practice

Pick a topic, command term and mark tariff, and get new questions with mark schemes. Useful when a class has burned through the set questions, or when you need a different version for a resit.

Exam prep

Full specimen-style papers

Generate a complete paper with the right section structure, mark distribution and timing, plus the mark scheme — so mocks stop depending on the handful of past papers that exist for a new syllabus.

Answer marking

Marked against the criteria

Submit a written answer and get it marked point by point: which marks were earned, which sentence would have earned the missing one, and how to phrase it for the command term used.

Study coach

1:1 topic sessions

A guided session on a single topic that explains, questions, and re-explains based on what the student gets wrong — the closest thing to a tutor for the evening before a test.

IA feedback

Draft review against criteria

Paste an IA draft section and get criterion-referenced feedback: what evidence is missing, where the documentation is thin, and what would move it into the next band.

Tracker

Weak spots, then targeted work

Progress tracking flags the topics a student keeps getting wrong, and the tools above generate against that list — so revision goes where the marks are actually being lost.

If you teach the course

A course you can pick up and teach on Monday

Lesson decks in scope-and-sequence order, so the year is already planned.

Explanations written on the slide — no separate lesson plan to prepare, no gaps to fill in from memory.

Handouts and revision booklets to print for the class as they stand.

Exam questions with mark schemes for homework, tests and mocks, plus generated papers when you need more.

PDF export for cover work, and speaker notes for anyone teaching the lesson for you.

If you're sitting the course

A revision path that knows what you keep getting wrong

Read any lesson you missed and understand it without a teacher present.

Practise with real command-term questions, then check against a full model answer.

See your weak topics tracked across every unit instead of guessing what to revise.

Get your written answers marked and told exactly which sentence was missing.

Revise from unit booklets in the fortnight before a paper, and get IA drafts reviewed before you submit.

One payment · one year · no subscription

Everything above, for $100 a year

Full access to every lesson deck, handout, revision booklet, practice question and answer key, plus the progress tracker. The AI tools run on separate pay-as-you-go credits, so you only pay for what you generate.

Get 1-year access Read a free lesson first