Identify each of these logic gates by name, and complete their respective truth tables:


In order to familiarize students with the standard logic gate types, I like to given them practice with identification and truth tables each day. Students need to be able to recognize these logic gate types at a glance, or else they will have difficulty analyzing circuits that use them.
Identify each of these relay logic functions by name (AND, OR, NOR, etc.) and complete their respective truth tables:


In order to familiarize students with standard switch contact configurations, I like to given them practice with identification and truth tables each day. Students need to be able to recognize these ladder logic subcircuits at a glance, or else they will have difficulty analyzing more complex relay circuits that use them.
A Karnaugh map is nothing more than a special form of truth table, useful for reducing logic functions into minimal Boolean expressions.
Here is a truth table for a specific threeinput logic circuit:

Complete the following Karnaugh map, according to the values found in the above truth table:


Showing students that Karnaugh maps are really nothing more than truth tables in disguise helps them to more readily learn this powerful new tool.
A Karnaugh map is nothing more than a special form of truth table, useful for reducing logic functions into minimal Boolean expressions.
Here is a truth table for a specific fourinput logic circuit:

Complete the following Karnaugh map, according to the values found in the above truth table:


Showing students that Karnaugh maps are really nothing more than truth tables in disguise helps them to more readily learn this powerful new tool.
Here is a truth table for a fourinput logic circuit:

If we translate this truth table into a Karnaugh map, we obtain the following result:

Note how the only 1’s in the map are clustered together in a group of four:

If you look at the input variables (A, B, C, and D), you should notice that only two of them actually change within this cluster of four 1’s. The other two variables hold the same value for each of these conditions where the output is a “1”. Identify which variables change, and which stay the same, for this cluster.
For this cluster of four 1’s, variables A and C are the only two inputs that change. Variables B and D remain the same (B = 1 and D = 1) for each of the four “high” outputs.
This question introduces students to the Karnaugh reduction principle of detecting contradictory variables in a grouped set.
Here is a truth table for a fourinput logic circuit:

If we translate this truth table into a Karnaugh map, we obtain the following result:

Note how the only 1’s in the map all exist on the same row:

If you look at the input variables (A, B, C, and D), you should notice that only two of them are constant for each of the “1” conditions on the Karnaugh map. Identify these variables, and remember them.
Now, write an SOP (SumofProducts) expression for the truth table, and use Boolean algebra to reduce that raw expression to its simplest form. What do you notice about the simplified SOP expression, in relation to the common variables noted on the Karnaugh map?
For this cluster of four 1’s, variables A and B are the only two inputs that remain constant for the four “1” conditions shown in the Karnaugh map. The simplified Boolean expression for the truth table is AB. See a pattern here?
This question strongly suggests to students that the Karnaugh map is a graphical method of achieving a reducedform SOP expression for a truth table. Once students realize Karnaugh mapping holds the key to escaping arduous Boolean algebra simplifications, their interest will be piqued!
One of the essential characteristics of Karnaugh maps is that the input variable sequences are always arranged in Gray code sequence. That is, you never see a Karnaugh map with the input combinations arranged in binary order:

The reason for this is apparent when we consider the use of Karnaugh maps to detect common variables in output sets. For instance, here we have a Karnaugh map with a cluster of four 1’s at the center:

Arranged in this order, it is apparent that two of the input variables have the same values for each of the four “high” output conditions. Redraw this Karnaugh map with the input variables sequenced in binary order, and comment on what happens. Can you still tell which input variables remain the same for all four output conditions?


Looking at this, we can still tell that B = 1 and D = 1 for all four “high” output conditions, but this is not apparent by proximity as it was before.
You could simply tell your students that the input variables must be sequenced according to Gray code in order for Karnaugh mapping to work as a simplification tool, but this wouldn’t explain to students why it needs to be such. This question shows students the purpose of Gray code sequencing in Karnaugh maps, by showing them the alternative (binary sequencing), and allowing them to see how the task of seeking noncontradictory variables is complicated by it.
Examine this truth table and corresponding Karnaugh map:

Though it may not be obvious from first appearances, the four “high” conditions in the Karnaugh map actually belong to the same group. To make this more apparent, I will draw a new (oversized) Karnaugh map template, with the Gray code sequences repeated twice along each axis:

Fill in this map with the 0 and 1 values from the truth table, and then see if a grouping of four “high” conditions becomes apparent.

Followup question: what does this problem tell us about grouping? In other words, how can we identify groups of “high” states without having to make oversized Karnaugh maps?
The concept of bit groups extending past the boundaries of a Karnaugh map tends to confuse students. In fact, it is about the only thing that tends to confuse students about Karnaugh maps! Simply telling them to group past the borders of the map doesn’t really teach them why the technique is valid. Here, they should see with little difficulty why the technique works.
And, if for some reason they just can’t visualize bit groups past the boundaries of a Karnaugh map, they know they can just draw an oversized map and it will become obvious!
A student is asked to use Karnaugh mapping to generate a minimal SOP expression for the following truth table:

Following the truth table shown, the student plots this Karnaugh map:

“This is easy,” says the student to himself. “All the ‘1’ conditions fall within the same group!” The student then highlights a triplet of 1’s as a single group:

Looking at this cluster of 1’s, the student identifies C as remaining constant (1) for all three conditions in the group. Therefore, the student concludes, the minimal expression for this truth table must simply be C.
However, a second student decides to use Boolean algebra on this problem instead of Karnaugh mapping. Beginning with the original truth table and generating a SumofProducts (SOP) expression for it, the simplification goes as follows:
$$\overline{A}BC+A\overline{B}C+ABC$$
$$BC(\overline{A}+A)+A\overline{B}C$$
$$BC+A\overline{B}C$$
$$C(B+A\overline{B})$$
$$C(B+A)$$
$$AC+BC$$
Obviously, the answer given by the second student’s Boolean reduction (AC BC) does not match the answer given by the first student’s Karnaugh map analysis (C).
Perplexed by the disagreement between these two methods, and failing to see a mistake in the Boolean algebra used by the second student, the first student decides to check his Karnaugh mapping again. Upon reflection, it becomes apparent that if the answer really were C, the Karnaugh map would look different. Instead of having three cells with 1’s in them, there would be four cells with 1’s in them (the output of the function being “1” any time C = 1:

Somewhere, there must have been a mistake made in the first student’s grouping of 1’s in the Karnaugh map, because the map shown above is the only one proper for an answer of C, and it is not the same as the real map for the given truth table. Explain where the mistake was made, and what the proper grouping of 1’s should be.
Proper grouping of 1’s in the Karnaugh map:

The purpose of this question is to illustrate how it is incorrect to identify clusters of arbitrary size in a Karnaugh map. A cluster of three, as seen in this scenario, leads to an incorrect conclusion. Of course, one could easily quote a textbook as to the proper numbers and patterns of 1’s to identify in a Karnaugh map, but it is so much more informative (in my opinion) to illustrate by example. Posing a dilemma such as this makes students think about why the answer is wrong, rather than asking them to remember seemingly arbitrary rules.
State the rules for properly identifying common groups in a Karnaugh map.
Any good introductory digital textbook will give the rules you need to do Karnaugh mapping. I leave you to research these rules for yourself!
The answer speaks for itself here  let your students research these rules, and ask them exactly where they found them (including the page numbers in their textbook(s)!).
A seven segment decoder is a digital circuit designed to drive a very common type of digital display device: a set of LED (or LCD) segments that render numerals 0 through 9 at the command of a fourbit code:

The behavior of the display driver IC may be represented by a truth table with seven outputs: one for each segment of the sevensegment display (a through g). In the following table, a “1” output represents an active display segment, while a “0” output represents an inactive segment:

A reallife example such as this provides an excellent showcase for techniques such as Karnaugh mapping. Let’s take output a for example, showing it without all the other outputs included in the truth table:

Plotting a Karnaugh map for output a, we get this result:

Identify adjacent groups of 1’s in this Karnaugh map, and generate a minimal SOP expression from those groupings.
Note that six of the cells are blank because the truth table does not list all the possible input combinations with four variables (A, B, C, and D). With these large gaps in the Karnaugh map, it is difficult to form large groupings of 1’s, and thus the resulting “minimal” SOP expression has several terms.
However, if we do not care about output a’s state in the six nonspecified truth table rows, we can fill in the remaining cells of the Karnaugh map with “don’t care” symbols (usually the letter X) and use those cells as “wildcards” in determining groupings:

With this new Karnaugh map, identify adjacent groups of 1’s, and generate a minimal SOP expression from those groupings.
Karnaugh map groupings with strict “1” groups:
$$\overline{D}B+\overline{D}CA+D \ \overline{C} \ \overline{B}+\overline{C} \ \overline{B} \ \overline{A}$$

Karnaugh map groupings with “don’t care” wildcards:
$$D+B+CA+\overline{C}\ \overline{A}$$

Followup question: this question and answer merely focused on the a output for the BCDto7segment decoder circuit. Imagine if we were to approach all seven outputs of the decoder circuit in these two fashions, first developing SOP expressions using strict groupings of “1” outputs, and then using “don’t care” wildcards. Which of these two approaches do you suppose would yield the simplest gate circuitry overall? What impact would the two different solutions have on the decoder circuit’s behavior for the six unspecified input combinations 1010, 1011, 1100, 1101, 1110, and 1111?
One of the points of this question is for students to realize that bigger groups are better, in that they yield simpler SOP terms. Also, students should realize that the ability to use “don’t care” states as “wildcard” placeholders in the Karnaugh map cells increases the chances of creating bigger groups.
Truth be known, I chose a pretty bad example to try to make an SOP expression from, since there are only two nonzero output conditions out of ten! Formulating a POS expression would have been easier, but that’s a subject for another question!
When designing a circuit to emulate a truth table such as this where nearly all the input conditions result in “1” output states, it is easier to use ProductofSums (POS) expressions rather than SumofProducts (SOP) expressions:

Is it possible to use a Karnaugh map to generate the appropriate POS expression for this truth table, or are Karnaugh maps limited to SOP expressions only? Explain your answer, and how you were able to obtain it.
Yes, you can use Karnaugh maps to generate POS expressions, not just SOP expressions!
I am more interested in seeing students’ approach to this problem than acknowledgment of the answer (that Karnaugh maps may be used to generate SOP and POS expressions alike). Setting up a Karnaugh map to see if a POS expression may be obtained for this truth table is not difficult to do, but many students are so unfamiliar/uncomfortable with “experimenting” in this manner than they tend to freeze when presented with a problem like this. Without specific instructions on what to do, the obvious steps of “try it and see” elude them.
It is your charge as their instructor to encourage an experimental mindset among your students. Do not simply tell them how to go about “discovering” the answer on their own, for if you do you will rob them of an authentic discovery experience.
Use a Karnaugh map to generate a simple Boolean expression for this truth table, and draw a relay logic circuit equivalent to that expression:

Simple expression and relay circuit:
$$B\overline{C}$$

One of the things you may want to have your students share in front of the class is their Karnaugh maps, and how they grouped common output states to arrive at Boolean expression terms. I have found that an overhead (acetate) or computerprojected image of a blank Karnaugh map on a whiteboard serves well to present Karnaugh maps on. This way, cell entries may be easily erased and redrawn without having to redraw the map (grid lines) itself.
Ask your students to compare using a Karnaugh map versus using standard SOP/Boolean simplifications to arrive at the simplest expression for this truth table. Which technique would they prefer to use, and why?
Use a Karnaugh map to generate a simple Boolean expression for this truth table, and draw a gate circuit equivalent to that expression:

Simple expression and gate circuit:
$$AC+BC\overline{D}$$

Challenge question: use Boolean algebra techniques to simplify the table’s raw SOP expression into minimal form without the use of a Karnaugh map.
One of the things you may want to have your students share in front of the class is their Karnaugh maps, and how they grouped common output states to arrive at Boolean expression terms. I have found that an overhead (acetate) or computerprojected image of a blank Karnaugh map on a whiteboard serves well to present Karnaugh maps on. This way, cell entries may be easily erased and redrawn without having to redraw the map (grid lines) itself.
Use a Karnaugh map to generate a simple Boolean expression for this truth table, and draw a gate circuit equivalent to that expression:

Simple expression and gate circuit:
$$AC+A\overline{B}\ \overline{D}$$

Challenge question: use Boolean algebra techniques to simplify the table’s raw SOP expression into minimal form without the use of a Karnaugh map.
One of the things you may want to have your students share in front of the class is their Karnaugh maps, and how they grouped common output states to arrive at Boolean expression terms. I have found that an overhead (acetate) or computerprojected image of a blank Karnaugh map on a whiteboard serves well to present Karnaugh maps on. This way, cell entries may be easily erased and redrawn without having to redraw the map (grid lines) itself.
This is one of those situations where an important group “wraps around” the edge of the Karnaugh map, and thus is likely to be overlooked by students.
Use a Karnaugh map to generate a simple Boolean expression for this truth table, and draw a relay circuit equivalent to that expression:

Simple expression and relay circuit:
$$B \overline{D}+\overline{C}\ \overline{D}$$

Followup question: although the relay circuit shown above does satisfy the minimal SOP Boolean expression, there is a way to make it simpler yet. Hint: done properly, you may eliminate one of the contacts in the circuit!
Challenge question: use Boolean algebra techniques to simplify the table’s raw SOP expression into minimal form without the use of a Karnaugh map.
One of the things you may want to have your students share in front of the class is their Karnaugh maps, and how they grouped common output states to arrive at Boolean expression terms. I have found that an overhead (acetate) or computerprojected image of a blank Karnaugh map on a whiteboard serves well to present Karnaugh maps on. This way, cell entries may be easily erased and redrawn without having to redraw the map (grid lines) itself.
This is one of those situations where an important group “wraps around” the edge of the Karnaugh map, and thus is likely to be overlooked by students.
Use a Karnaugh map to generate a simple Boolean expression for this truth table, and draw a relay circuit equivalent to that expression:

Simple expression and relay circuit:
$$B +\overline{D}$$

Given the preponderance of 1’s in this truth table, it is rational to try developing a POS expression rather than an SOP expression. However, your students may find that the elegance of Karnaugh mapping makes it easy enough to do it both ways! This is one question where you definitely want to have your students explain their methods of solution in front of the class, and you definitely want them to see how Karnaugh maps could be used both ways (SOP and POS).
I have found that an overhead (acetate) or computerprojected image of a blank Karnaugh map on a whiteboard serves well to present Karnaugh maps on. This way, cell entries may be easily erased and redrawn without having to redraw the map (grid lines) itself.
Published under the terms and conditions of the Creative Commons Attribution License
by Jake Hertz
by Gary Elinoff
by Gary Elinoff
by Gary Elinoff