Bespoke, fully editable lesson for the new IB Diploma Computer Science syllabus (first assessment 2027): B4.1.2 Evaluating linked lists. Slides, worksheet and full answers.

Written for the 2027 IB Computer Science guide, unit B4 Abstract data types (HL only). Everything is editable, so you can adapt it to your class.

What’s included

• PowerPoint lesson (13 slides) with speaker notes on every slide
• Student worksheet (Word), ready to print or edit
• Answer sheet (Word) with model answers for every question

B4.1.2 Evaluating linked lists

By the end of the lesson students can:

• Describe the structure of singly and doubly linked lists
• Show traversal, search, insertion and deletion with diagrams
• Evaluate linked lists against arrays for a given task

Worksheet sections: A. Parts of a linked list; B. Trace the operations; C. Search; D. Doubly linked list; E. Evaluate

Every lesson includes

• Learning goals and a starter question
• Clear explanations with worked examples (Python where code is needed)
• A quick check and a “your turn” task linked to the worksheet
• An exit ticket

Format

• PowerPoint (.pptx) and Word (.docx), fully editable
• Works in PowerPoint and Google Slides
• Calm pastel design, consistent across the whole IB course

These are independent resources written for the IB Diploma Programme Computer Science guide (first assessment 2027). They are not produced or endorsed by the International Baccalaureate Organization.