Firefly needs a modern browser, so you may notice things look broken right now.

To get a better experience, try one of the supported browsers listed here.

  • Explore
    • 1.1 The characteristics of contemporary processors, input, output and storage devices
    • 1.2 Software and software development
    • 1.3 Exchanging Data
    • 1.4 Data types, data structures and algorithms
      • 1.4.1 Data Types
      • 1.4.2 Data Structures
      • 1.4.3 Boolean Algebra
        • 01 Define problems using Boolean & Logic Gates and Truth Tables
        • 02 Karnaugh Maps
        • 03 Simplify Boolean Statements
        • 04 The logic associated with D type flip flops, half and full adders
        • 06 Section Overview and Learning Record
    • 1.5 Legal, moral, cultural and ethical issues
  • 1.4 Data types, data structures and algorithms
  • 1.4.3 Boolean Algebra
  • 03 Simplify Boolean Statements

03 Simplify Boolean Statements


Lesson PowerPoint 


  • Simplify Boolean.pptx5mb

Rules of Boolean Algebra

  • Rules of Boolean Algebra.docx


Lesson Activities

  • 04. A-Level - Simplification Activity 1 (General rules).pptx
  • 04. A-Level - Simplification Activity 2 (Commutation).pptx
  • 04. A-Level - Simplification Activity 3 (Association).pptx
  • 04. A-Level - Simplification Activity 4 (De Morgans law).pptx
  • 04. A-Level - Simplification Activity 5 (Distribution).pptx
  • 04. A-Level - Simplification Activity 6.pptx
  • 04. A-Level - Simplification Activity 7.pptx

Practice Questions

  • Boolean_Simplification.pdf

The Race to Harness Quantum Computing's Mind-Bending Power | The Future With Hannah Fry

  • Last updated by Mrs R Lofthouse
  • Last updated 24/10/2024
  • More page information