A Level Computer Science: Karnaugh maps
This module contains:
Compatible with the following examination boards
Download A Level Module 41: Karnaugh maps
This download is exclusively for Teach Computer Science subscribers!
To download this file, click the button below to signup (it only takes a minute) and you'll be brought right back to this page to start the download!
Already a member? Log in to download.
Karnaugh maps
In the previous topic, you learnt to simplify Boolean expressions using de Morgan’s laws and Boolean algebra. In this topic, an alternate approach to simplify a Boolean expression is explained. Karnaugh mapping is a graphical representation of a Boolean expression. This method is easier and faster to simplify Boolean expressions. Boolean expression with up to 4 variables shall be solved using this method. Beyond 4 variables, we need computer programs to solve the expressions.
This A Level Computer Science module introduces Karnaugh maps to your students, explaining:
- Simplifying Boolean expressions with 2, 3 and 4 variables using Karnaugh maps
More Data types, data structures and algorithms
Karnaugh maps is one lesson in our Data types, data structures and algorithms module. The other theory lessons can be found below:
