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
  • 02 Karnaugh Maps

02 Karnaugh Maps

  • 98. OCR A Level (H046-H446) Karnaugh maps Part 1.pptx7mb
  • 99. OCR A Level (H046-H446) Karnaugh maps Part 2.pptx7mb
  • 100. OCR A Level (H046-H446) Karnaugh maps Part 3.pptx7mb
  • 101. OCR A Level (H046-H446) Karnaugh maps Part 4.pptx7mb




Lesson PowerPoint

  • Karnaugh Maps.pptx5mb

Lesson Activities 

  • 03. Karnaugh maps Activity 1 (two input).pptx
  • 03. Karnaugh maps Activity 2 (three input).pptx
  • 03. Karnaugh maps Activity 3 (four input).pptx

Extra Questions

‘Application and Challenge’ Questions

For the following truth tables:

a. Construct a Karnaugh Map

b. Find the groupings of 1 (in accordance to the Karnaugh Map rules)

c. State the simplified Boolean expression

Exam Question Practice

  • OCR_ExamBuilder_test_export (6).pdf4mb
  • Last updated by Mrs R Lofthouse
  • Last updated 21/10/2024
  • More page information