How do I solve a Karnaugh Map?

Solving a Karnaugh Map can be very tricky as it requires a new type of thinking than you may be used to. I find the best method to solve a Karnaugh map to be setting it out as a table. Let's use the following expression as an example. (a ^ b ^ ¬c) v ((a ^ ¬b) v c). We set the grid up as follows, 2 variables along the side and one on the top. We then fill in the answers to each box in the grid using the values of the variables at the side and top and writing in the answer to the expression using the values of the variables along the top and side of the box. Once that is filled in we look for patterns. We are looking for 1s as we need to draw boxes around them. These boxes must be of size 2^x. So size 1 = 2^0, size 2 = 2^1, size 4 = 2^2, etc. The 1s in a box can't be diagonal but they can go over the edge of the box to the other side. Finally the boxes shoul be as big as possible and we have to cover all the 1s. So I'll fll this one in an you should see exactly how it works.

DD
Answered by Daniel D. Computing tutor

1957 Views

See similar Computing A Level tutors

Related Computing A Level answers

All answers ▸

Describe what you understand by abstraction, and how it is relevant to software engineering.


The numbers 6B and 12 are displayed in hexadecimal form. Convert them into binary form and perform binary addition to find the sum. Convert your answer back into hexadecimal. Show your workings.


Represent the denary number 5.625 as an unsigned binary fixed point number with three bits before and five bits after the binary point.


A common construct found in many algorithms is a loop. Using pseudocode, write a pre-condition loop to output all of the even numbers between 99 and 201.


We're here to help

contact us iconContact ustelephone icon+44 (0) 203 773 6020
Facebook logoInstagram logoLinkedIn logo

MyTutor is part of the IXL family of brands:

© 2025 by IXL Learning