Resources included (16)

File processing – IB Computer Science lesson

Writing recursive algorithms – IB Computer Science lesson

Recursion – IB Computer Science lesson

Bubble sort and selection sort – IB Computer Science lesson

Linear and binary search – IB Computer Science lesson

Big O notation – IB Computer Science lesson

Functions and modular code – IB Computer Science lesson

Loops: for and while – IB Computer Science lesson

Selection – IB Computer Science lesson

Sequence and order of instructions – IB Computer Science lesson

Queues – IB Computer Science lesson

Stacks – IB Computer Science lesson

Lists and 2D lists – IB Computer Science lesson

Static and dynamic data structures – IB Computer Science lesson

Working with strings – IB Computer Science lesson

Variables and data types – IB Computer Science lesson
16 ready-to-teach lessons for IB Diploma Computer Science (first assessment 2027): Programming. Every lesson has editable PowerPoint slides, a student worksheet and full answers, and the bundle costs less than buying the lessons one by one.
A complete, ready-to-teach bundle for IB Computer Science (first assessment 2027): Programming, in 16 bespoke lessons written for the new syllabus.
Every lesson comes with:
- Editable PowerPoint slides – goals, starter, explanations, worked examples, a task and an exit ticket, with teacher notes
- Student worksheet (Word) – structured questions that build from recall to exam-style application
- Answer sheet (Word) – full model answers for quick marking or self-assessment
Worth £79.84 if bought lesson by lesson.
What’s insideB2.1 Programming fundamentals
- B2.1.1 Variables and data types
- B2.1.2 Working with strings
B2.2 Data structures
- B2.2.1 Static and dynamic data structures
- B2.2.2 Lists and 2D lists
- B2.2.3 Stacks
- B2.2.4 Queues
B2.3 Programming constructs
- B2.3.1 Sequence and order of instructions
- B2.3.2 Selection
- B2.3.3 Loops: for and while
- B2.3.4 Functions and modular code
B2.4 Programming algorithms
- B2.4.1 Big O notation
- B2.4.2 Linear and binary search
- B2.4.3 Bubble sort and selection sort
- B2.4.4 Recursion (HL)
- B2.4.5 Writing recursive algorithms (HL)
B2.5 File processing
- B2.5.1 File processing
- Mapped code by code to the 2027 IB CS guide, so coverage is easy to track
- SL and HL content clearly labelled
- Fully editable – adapt to your class, timings and school template
- Works for teaching, revision, cover lessons and homework
Last updated: November 2026.
Something went wrong, please try again later.
This resource hasn't been reviewed yet
To ensure quality for our reviews, only customers who have purchased this resource can review it
Report this resourceto let us know if it violates our terms and conditions.
Our customer service team will review your report and will be in touch.
