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

1864 Views

See similar Computing A Level tutors

Related Computing A Level answers

All answers ▸

What the main differences between an interpreter and a compiler?


Why are bit patterns often displayed in hexadecimal notation instead of binary notation?


Calculate -3 + 3 using Two's Complement and the Sign and Magnitude Method. Which works correctly?


Describe the process of a binary search.


We're here to help

contact us iconContact usWhatsapp logoMessage us on Whatsapptelephone icon+44 (0) 203 773 6020
Facebook logoInstagram logoLinkedIn logo

© MyTutorWeb Ltd 2013–2025

Terms & Conditions|Privacy Policy
Cookie Preferences