Resources included (16)

IB Computer Science 2027 – B2.5.1 File processing – Lesson & Worksheet

IB Computer Science 2027 – B2.4.5 Writing recursive algorithms – Lesson & Worksheet

IB Computer Science 2027 – B2.4.4 Recursion – Lesson & Worksheet

IB Computer Science 2027 – B2.4.3 Bubble sort and selection sort – Lesson & Worksheet

IB Computer Science 2027 – B2.4.2 Linear and binary search – Lesson & Worksheet

IB Computer Science 2027 – B2.4.1 Big O notation – Lesson & Worksheet

IB Computer Science 2027 – B2.3.4 Functions and modular code – Lesson & Worksheet

IB Computer Science 2027 – B2.3.3 Loops: for and while – Lesson & Worksheet

IB Computer Science 2027 – B2.3.2 Selection – Lesson & Worksheet

IB Computer Science 2027 – B2.3.1 Sequence and order of instructions – Lesson & Worksheet

IB Computer Science 2027 – B2.2.4 Queues – Lesson & Worksheet

IB Computer Science 2027 – B2.2.3 Stacks – Lesson & Worksheet

IB Computer Science 2027 – B2.2.2 Lists and 2D lists – Lesson & Worksheet

IB Computer Science 2027 – B2.2.1 Static and dynamic data structures – Lesson & Worksheet

IB Computer Science 2027 – B2.1.2 Working with strings – Lesson & Worksheet

IB Computer Science 2027 – B2.1.1 Variables and data types – Lesson & Worksheet
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
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.
£44.99
