OCR GCSE Computer Science 2.4 Boolean Logic: Complete Unit (J277)

A complete, ready-to-teach unit for OCR GCSE Computer Science topic 2.4, Boolean Logic (J277, Paper 2). Six editable PowerPoint lessons, a work booklet, a homework booklet and full answers cover AND, OR and NOT, truth tables, Boolean expressions and logic circuits. All gate and circuit diagrams are drawn for you.

The six lessons

Logic Gates: AND, OR and NOT: symbols, rules, truth tables and the ∧, ∨ and ¬ notation
Truth Tables: counting rows, listing every combination, and truth tables with up to three inputs
Boolean Expressions: reading and writing expressions, brackets and the order of operations
Drawing Logic Circuits: turning an expression into a circuit using AND, OR and NOT
Reading Circuits and Solving Problems: circuit to expression to truth table, with alarm and safe examples
Boolean Logic in Programs: AND, OR and NOT in conditions, testing every combination, and De Morgan’s law as an extension

What’s included

6 full lessons (editable PowerPoint) with teacher notes: each has a retrieval grid, Do Now, learning objectives, taught content, I do, we do, you do, varied activities, Green, Amber and Red independent practice, a Success Check quiz and a plenary, with answers slides throughout
Work booklet (43 pages) with answers: notes pages, truth tables, drawing boxes and tiered practice
Homework booklet (17 pages) with answers: six homeworks and a unit review, also as a PDF
Drawn circuits and truth tables: every diagram and table is accurate, with answers shown on the slides and in the booklets
Varied activities: card sorts, matching, truth tables to complete, circuits to draw and read, and spot the mistake

Original Logic Page resource, written for the OCR J277 specification. Not produced or endorsed by OCR.