pptx, 384.5 KB
pptx, 384.5 KB
pptx, 372.38 KB
pptx, 372.38 KB
pptx, 388.31 KB
pptx, 388.31 KB
pptx, 380.72 KB
pptx, 380.72 KB
pptx, 866.4 KB
pptx, 866.4 KB
pptx, 604.82 KB
pptx, 604.82 KB
docx, 65.12 KB
docx, 65.12 KB
docx, 62.81 KB
docx, 62.81 KB
docx, 63.34 KB
docx, 63.34 KB
docx, 62.58 KB
docx, 62.58 KB
docx, 11.41 KB
docx, 11.41 KB
docx, 11.91 KB
docx, 11.91 KB
docx, 64.5 KB
docx, 64.5 KB
docx, 63.67 KB
docx, 63.67 KB
docx, 62.53 KB
docx, 62.53 KB
docx, 121.41 KB
docx, 121.41 KB
pptx, 123.65 KB
pptx, 123.65 KB
pdf, 814.86 KB
pdf, 814.86 KB
pptx, 121.84 KB
pptx, 121.84 KB
pptx, 131.55 KB
pptx, 131.55 KB
pptx, 136.99 KB
pptx, 136.99 KB
txt, 1.31 KB
txt, 1.31 KB
txt, 700 Bytes
txt, 700 Bytes
txt, 1.03 KB
txt, 1.03 KB
txt, 1.17 KB
txt, 1.17 KB
docx, 67.59 KB
docx, 67.59 KB
txt, 10.53 KB
txt, 10.53 KB
txt, 8.52 KB
txt, 8.52 KB

Complete OCR J277 GCSE Computer Science 2.1 Algorithms unit: 6 lessons, work booklet, homework, assessments & answers. Exam Reference Language throughout.

Everything you need to teach OCR GCSE Computer Science (J277) section 2.1 Algorithms, ready to use straight away. Every lesson, booklet and assessment comes with full answers, and all files are fully editable.

6 complete lessons (PowerPoint)

  1. Computational Thinking: abstraction, decomposition and algorithmic thinking
  2. Inputs, Processes, Outputs and Structure Diagrams: identifying inputs, processes and outputs, and creating and interpreting structure diagrams
  3. Flowcharts: all six OCR flowchart symbols, including the sub program symbol
  4. Tracing Algorithms: trace tables, working out the purpose of an algorithm, and finding syntax and logic errors
  5. Searching Algorithms: linear and binary search, with step-by-step animations
  6. Sorting Algorithms: bubble sort, merge sort and insertion sort, with worked examples of every stage

Every lesson follows the same clear structure:

  • Learning objectives and a retrieval Do Now
  • Clear explanations with worked examples (I do, we do, you do)
  • Differentiated independent practice (green, amber and red challenges)
  • Exam-style questions with mark schemes
  • Detailed teacher notes on every slide, including misconceptions and teaching suggestions

Written in OCR Exam Reference Language
All algorithms use OCR Exam Reference Language, the style used in J277 exam papers (for example: for i = 0 to 9 … next i, if … then … endif, MOD, DIV and .length), so students practise reading code exactly as it appears in the exam.

Work booklet (A4, printable)
A 20-page student workbook covering all six lessons, with a key terms glossary and an end-of-unit RAG checklist. Full answer booklet included.

Homework booklet
Six homeworks, one per lesson, designed to be completed at home with no class notes needed. Each starts with a “Remember” box of key facts, and every answer box can be typed into on screen or written on paper. Supplied as PowerPoint and PDF, with a full answer copy.

Assessments

  • Mid-unit written paper (40 marks) and end-of-unit written paper (60 marks), each with a detailed mark scheme
  • Two multiple-choice quizzes (20 and 30 questions)
  • Self-marking quizzes: a ready-made Google Apps Script builds each quiz in Google Forms for you, with answers, marks and feedback already set up. Step-by-step instructions for Microsoft Forms are also included.
  • A teacher guide with answer keys

Additional activities

  • 30 progressive Python trace table tasks (green to red), with answers
  • Tracing Algorithms worksheet in OCR Exam Reference Language, with answers
  • OCR Reference Language to Python activity (13 tasks), with answers
  • Python programs for bubble sort, merge sort, insertion sort, linear search and binary search

Why teachers will love it

Reviews

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.