Are we supposed to memorize Karnaugh maps?

  • Thread starter tamtam402
  • Start date
In summary, you should memorize the order of the bits for 2, 3, and 4 variable karnaugh maps, but it is irrelevant what order you use to lay out the variables.
  • #1
tamtam402
201
0
Hey guys, my professor briefly introduced Karnaugh maps and I was wondering if I'm supposed to memorize which areas correspond to which inputs (bits). Is there a trick to rebuild Karnaugh maps from memory? Just to be clear, I know how to use them to find a minimal sum of products, I'm talking about the maps "frames".
 
Engineering news on Phys.org
  • #2
No. Each map is unique to the problem at hand. Memorize the reductions.
 
  • #3
I'm not talking about the filled map, I'm talking about the "shell". For example, a 3 inputs map can always be drawn this way:

0 Y XY X
Z YZ XYZ XZThen, if I were asked to write an expression for F = ƩX,Y,Z(0,2,7), the filled map would look like this:

0 = 000, 2 = 010 and 7 = 111. Which means:

1 1 0 0
0 0 1 0EDIT: you were referencing to the 2nd part of the problem. I know the filled map is unique. I'm asking about the shell of the map, which will always have the same possible forms for a X inputs. Obviously the possible forms are easy to find for a 3 input map, but you should understand what I'm talking about.
 
  • #4
tamtam402 said:
I'm not talking about the filled map, I'm talking about the "shell". For example, a 3 inputs map can always be drawn this way:

0 Y XY X
Z YZ XYZ XZ


Then, if I were asked to write an expression for F = ƩX,Y,Z(0,2,7), the filled map would look like this:

0 = 000, 2 = 010 and 7 = 111. Which means:

1 1 0 0
0 0 1 0


EDIT: you were referencing to the 2nd part of the problem. I know the filled map is unique. I'm asking about the shell of the map, which will always have the same possible forms for a X inputs. Obviously the possible forms are easy to find for a 3 input map, but you should understand what I'm talking about.

I think you should memorize the order of the bits for 2, 3, and 4 variable karnaugh maps . . its just remembering that one of the bit orders is flipped with 3 and 4 variables. That way you can set up your maps for those cases. This will cover you in an exam, but the professor might even be nice and write out the empty map for you. But you don't need to memorize this later in life if that's what you're asking.
 
  • #5
It is utterly irrelevant what order you use to lay out the variables in a K-map. As long as you are consistent between what you draw and how you interpret it, you'll get the exact same answer regardless of the order of the variables.

If your prof wants you to stick to some specific layout, he is being WAY overly anal about it.
 
  • #6
As you come along in your studies...solving the maps will be the easy part.

Setting up the maps from a tricky circuit will be the bigger challenge eventually.
 

1. What is a Karnaugh map?

A Karnaugh map, also known as a K-map, is a graphical method used to simplify Boolean algebra expressions. It is a tool commonly used in digital electronics and computer science.

2. Do I need to memorize Karnaugh maps?

No, you do not need to memorize Karnaugh maps. However, it is important to understand how to use them and be familiar with their layout and rules in order to effectively simplify Boolean expressions.

3. How do you read a Karnaugh map?

A Karnaugh map is read from left to right and top to bottom. Each square in the map represents a unique combination of inputs, and the resulting output is written inside the square. The squares are grouped together in a specific pattern to identify the simplified expression.

4. Can I use a Karnaugh map for any Boolean expression?

Yes, a Karnaugh map can be used to simplify any Boolean expression with up to 4 variables. However, it is most commonly used for expressions with 3 or fewer variables.

5. Are there any tips for effectively using Karnaugh maps?

Yes, here are a few tips: 1) Group together as many squares as possible in the map to simplify the expression, 2) Look for adjacent squares with only one variable changing to create larger groups, and 3) Remember that the edges of the map "wrap around" to the opposite side to create groups.

Similar threads

  • Electrical Engineering
Replies
4
Views
3K
  • Engineering and Comp Sci Homework Help
Replies
2
Views
2K
  • Engineering and Comp Sci Homework Help
Replies
2
Views
8K
  • General Math
Replies
8
Views
1K
  • STEM Academic Advising
Replies
3
Views
1K
  • Biology and Medical
Replies
1
Views
6K
  • Programming and Computer Science
Replies
3
Views
1K
Replies
13
Views
3K
Replies
6
Views
1K
  • Differential Geometry
Replies
3
Views
3K
Back
Top