OCR GCSE Computer Science J277 – OC2.41 Binary search – Lesson & Worksheet

Bespoke, fully editable lesson for OCR GCSE (9–1) Computer Science (J277): OC2.41 Binary search. Slides, worksheet and full answers.

Written for J277/02 Computational thinking, algorithms and programming, section 2.1 Algorithms (spec 2.1.3.1). Everything is editable, so you can adapt it to your class.

What’s included

• PowerPoint lesson (13 slides) with teacher notes on every slide
• Student worksheet (Word), ready to print or edit
• Answer sheet (Word) with mark-scheme style answers for every question

OC2.41 Binary search

By the end of the lesson students can:

• State that a binary search needs the data to be sorted, and explain why
• Apply a binary search to a list, showing each middle item checked
• Recognise binary search code and compare it with a linear search

Worksheet sections: A. True or false?; B. Apply the algorithm; C. Trace and test; D. Exam-style questions; E. Challenge

Every lesson includes

• Learning goals and a starter question
• Clear explanations, diagrams and worked examples (Python 3 throughout, with the OCR Exam Reference Language alongside)
• A quick check and a “your turn” task linked to the worksheet
• Exam-style questions with marks, and an exit ticket

Format

• PowerPoint (.pptx) and Word (.docx), fully editable
• Works in PowerPoint and Google Slides
• Bright, clear GCSE design, consistent across the whole course

These are independent resources written for the Cambridge OCR GCSE (9–1) Computer Science specification (J277, version 3.1). They are not produced or endorsed by OCR or Cambridge University Press & Assessment. Spec point numbers are our own numbering of the specification statements.