Karnaugh Maps - Introduction
This computer science video is an introduction to Karnaugh maps, otherwise known as K-maps. A Karnaugh map is a modified form of truth table that makes it easier to recognise patterns in the output of circuits involving logic gates. It covers creating a Karnaugh map from a standard truth table for a logic circuit, and the interpretation of a Karnaugh map to derive a minimised Boolean expression. Specifically, this video covers Karnaugh maps for circuits with 2 variables and 3 variables, and the rules for grouping output values.
Пікірлер: 280
I just can't express my gratitude for having people like you in this world, you are helping thousands of students for free ! God bless you so much .
@ComputerScienceLessons
3 жыл бұрын
It's my pleasure :)KD
I've been pulling my hair out for the last 5 hours reading a college text book for an undergrad class dealing with this. Thank you so much for this elegant, simple explanation.
@KrestenGiese
5 жыл бұрын
These problems fried my circuits, smh. Who thought of this?
@AlexandrBorschchev
4 жыл бұрын
@@KrestenGiese karnaugh
@emperor8716
5 ай бұрын
@@AlexandrBorschchevactually made me LOL. but anyway i gotta thank Karnaugh cuz this is better than SOP or POS
Thank you for a simple explanation. A lot of these professors like to show how smart they are by drowning you in theory when a simple explanation will do.
Great video. Some things to expand on: 1. These can be used for 4 inputs. Make a 4x4 grid and order both sides as the longer side is done in the video. 2. Instead of thinking about the number of 1s being a power of 2, just make the side lengths a power of 2; it's the same thing 3. The reason you want to make the largest rectangles and the fewest number of them, are the larger the rectangle the simpler the rule, as more variables are ignored, and the fewer the number of rectangles the fewer number of rules. 4. Sometimes we don't care if an input is a 0 or 1 (such as in a 7 segment display where we only care about 0-9 in 4 bits, then 10-15 are irrelevant. In those cases, an "X" is used to denote an input for which we do not care about the result, and "X"s can be included or not included in the rectangles; it does not matter, as opposed to 1s which must be and 0s which must not be.
This is by far the EASIEST explanation of the k-map! Thanks a lot! You got my sub!
Calm voice and clear diction makes this video enjoyable, thank you !
thank god... finally a tutorial that I can understand the tutor...
@d-thec-tieve4648
4 жыл бұрын
My problem with basically all KZread CS content 😐😂
@NotMarkKnopfler
4 жыл бұрын
@Oliver Fong - Amen. You took the words out of my mouth!
@0x44Monad
3 жыл бұрын
@@d-thec-tieve4648 seriously...
@damarigeorge1412
2 жыл бұрын
You prolly dont care but does anyone know of a trick to log back into an instagram account?? I stupidly forgot the account password. I would appreciate any help you can give me.
@ErrikosAlexiou
2 жыл бұрын
@@damarigeorge1412 try forgot password doofus.
you explained so nicely, i have watched 10s of k-map videos, but they were not as excellent and clear as yours, you saved my life, thanks a lot, subscribed
This is a great video. Sir, you have added value to the world.
As soon as i wathced the video i subscribed for the crystal-clear explanation and quality of your videos. Nice work.
Best K-map tutorial so far. Excellent stuff and many thanks.
Amazing. I have watched quite a number of your videos and every one of them have been explained very clearly, which has made them all very understandable. thank you.
@ComputerScienceLessons
4 жыл бұрын
Thank you for the lovely comment. :)KD
This series is the best presentation on this topic I've seem. Thank u
This was the best video ive seen on k-maps. I had such a hard time trying to understand this concept. Thank you @Computer Science!!
Very clear explanation and tons of examples, thank you!
Honestly even 7 years later,as a CS undergrad (1st yr) your content has helped me understand what im working with deeply and on behalf ot the hundreds of thousands who also watched these videos,THANK YOU SO MUCH YOU ARE EXCELENT AT WHAT YOU ARE DOING.
@ComputerScienceLessons
5 ай бұрын
Thanks a million. Really appreciated :)KD
Deep Respect and many many thanks for sharing knowledges in clean and extremely digestible format.God bless You !
Finally, I tried going through different videos but I somehow can't understand it but thanks to you I was able to get it! Thank you very much!
@ComputerScienceLessons
4 жыл бұрын
You're welcome. Thanks a million for the lovely comment. :) KD
Great explanation easy to understand. Much faster and more concise than any I've come across.
@ComputerScienceLessons
4 жыл бұрын
Good to hear. Thanks :)KD
Really awesome video, clear and concise. Thank you!
This is the great video for saving a lot of life.
This video is a true treasure!! Brilliant explanation and fabulously presented. Thank you.
Thank you for the beautifully executed resource on this subject.
crystal clear introduction, im sure ill have no problem following my professor when this gets brought up in lecture
@ComputerScienceLessons
2 жыл бұрын
Thank you. I hope you stay ahead of the game :)KD
I just got a 83% for my exam because of your video, thanks alot!
You have won my like and my respect, thanks a lot!
fantastic video, very clear and thorough.
Thank you sir for Excellent explaination with good examples.
Thank you, I have an exam tomorrow and this cleared everything up!
Stunning job . Well done and thank you very much .
@ComputerScienceLessons
6 жыл бұрын
You comment is much appreciated. Thanks.
great video sir. refreshing to hear an english accent teach stuff like this on yt
@ComputerScienceLessons
2 ай бұрын
Thank you :)KD
You saved my life, thank you sir.
Excellent and Thorough!
This was really helpful, thanks a lot!
Apun inspection, this video is great! Thanks!
Very nice! I wonder if there are tools similar to K-maps for simplifying Boolean expressions into NAND or NOR gate expressions? I've learned on MIT OCW that those are universal gates and tend to be faster and occupy less area in comparison to the 'regular' non-inverting gates.
Absolutely fantastic. Thanks a lot.
Good explanation. Thank you so much.
Excellent explanation. Thank you!!!!
Thank you! This was helpful.
very good tutorial. your an excellent teacher
Thank you! This was great!
I am so grateful to you!!
Thanks, it is so easy to understand.
Im confused at 9:44 arent those groups represent (B + AB') and (A'B + A) respectively? Cuz for the group of two, they dont change regardless of the value of C...
Very good explanation!!
Thanks! Beautiful explanations!
@ComputerScienceLessons
4 жыл бұрын
Thanks for saying so. :)KD
Best tutorial for K-maps ever!
@ComputerScienceLessons
4 жыл бұрын
Thanks for saying so. :) KD
Amazing explanation. Thank you!!
@ComputerScienceLessons
2 жыл бұрын
You're very welcome. Thanks :)KD
best explanation for me thank you !!
@ComputerScienceLessons
5 жыл бұрын
You are welcome. Thanks a million. :)
Thank you! It helped me a lot😃
Awesome! Thank you so much.
best teaching I ever had!
@ComputerScienceLessons
3 жыл бұрын
Wow - thanks :)KD
Great summary
Thanks a lot, i have an exam in like 12 hours and i'm studying the entire semester right now. Thank you
@ComputerScienceLessons
4 жыл бұрын
You're pushing it. Good luck. Stay positive. :)KD
@IStMl
4 жыл бұрын
So ?
@yuhyuh5674
2 жыл бұрын
@@IStMl?
Clear and totally understandable and quick
@ComputerScienceLessons
3 жыл бұрын
Thank you :)KD
thanks sir. best tutorial ever
Thank you for this! I’m in a Digital Electronics Class (PLTW Engineering) and I have an exam tomorrow!
@ComputerScienceLessons
3 жыл бұрын
Good luck :)KD
very good explanation and great examples, thank you
@ComputerScienceLessons
Жыл бұрын
You're welcome :)KD
my god thank you so much for this clear explanation, was going crazy stuck on this
@ComputerScienceLessons
Жыл бұрын
You're very welcome. Glad to help :)KD
Thanks a lot sir for the so easily understandable presentation!!
@ComputerScienceLessons
3 жыл бұрын
You're very welcome :)KD
I agree with Oliver Best Tutorial no one explained before that Karnaugh Maps were layed out in Gray Code!
@ComputerScienceLessons
3 жыл бұрын
Thank you :)KD
The best video tutorial about Karnaugh Maps! I'm taking an exam in 2 hours.
@ComputerScienceLessons
6 жыл бұрын
I hope the exam went well.
What if there is unknown, x. Then what is the Boolean equation would be for x?
this is a *stellar* video...thanks very very much 🙏
@ComputerScienceLessons
3 жыл бұрын
Thank YOU. :)KD
Epic video ! Thank god !
Great video!
@ComputerScienceLessons
2 жыл бұрын
Thank you :)KD
Thank you, explained so well and clear!
this guys vids are too good
@ComputerScienceLessons
2 жыл бұрын
This guy thanks you :)KD
Good and clear explanation about K-Map. Thankyou
@ComputerScienceLessons
Жыл бұрын
Thank you :)KD
This was good but I really wish you'd describe the difference between minterm and maxterm and give examples using that terminology.
Thank you so much, sir!
@ComputerScienceLessons
3 жыл бұрын
You are very welcome :)KD
You do a great job teaching this stuff!
@ComputerScienceLessons
2 жыл бұрын
Thank you :)KD
Sir I think you've dropped this : 👑
@ComputerScienceLessons
6 ай бұрын
I lost one of those playing Fortnite. Thanks :)KD
Thanks so much for making this nice and clear
@ComputerScienceLessons
2 жыл бұрын
You are very welcome :)KD
nice video dude!
Holy shit man, god of tutorials, nice.
@ComputerScienceLessons
4 жыл бұрын
Good to hear. Thanks :)KD
This is a great video! Very insightful. However, to add further clarification and so that the viewer knows what to look for, I think that the summary should be put in the beginning and the end of the video.
@ComputerScienceLessons
3 жыл бұрын
Thanks for the comment. In a classroom I usually apply the pedagogy: "tell them what you're going to tell them, tell them, tell them what you told them". Perhaps I should do more of this in my videos. :)KD
good video, old but high quality!
Brilliant, thanks.
@ComputerScienceLessons
3 жыл бұрын
You're most welcome :)KD
great vid, love it kevin
thank you so much its very easy to understand
@ComputerScienceLessons
4 жыл бұрын
You're welcome.
Omg, thank you so much🥰.
Thank you thank you!
@ComputerScienceLessons
3 жыл бұрын
You are most welcome :)KD
I loved this video thank you
@ComputerScienceLessons
5 жыл бұрын
Thanks for the comment. I love the cat.
from where or how the truth table has come? whats the operation?
@ComputerScienceLessons
6 жыл бұрын
Please take a look at my playlist on Logic Gates.
Thank you so much
whoa I'm surprised just how terrible my teacher is at teaching this, I thought this thing is borderline impossible for me to understand. Thanks for the video!
@ComputerScienceLessons
2 жыл бұрын
You are very welcome. K maps are great once you get the hand. You have to watch out for typos on text books, they can confuse the heck out of people :)KD
Thank you, Sir.
@ComputerScienceLessons
6 жыл бұрын
;)
What does he mean when he says the output of the k map is independent of a variable
Thank you!
@ComputerScienceLessons
3 жыл бұрын
You're welcome :)KD
this channel's name man, i hope someone creates a math channel too that teaches it
@ComputerScienceLessons
4 жыл бұрын
I wish I had time. This website is really good though. betterexplained.com/
when you say not a or not b, but the expression is A nand B, what's the expression? A + B or A * B ?
I coud not understand the last example, could you please explain it or send any further link on the last example ??
@ComputerScienceLessons
2 жыл бұрын
I'll assume you are happy with the idea that a K-map can be rolled into a cylinder to get the biggest possible group of 1s (as in the previous example). In this case, it is a group of two 1's as illustrated. (I suggest you sketch this on a piece of paper and have it in front of you before you read on). Now look at the column heading for this group of 1s and you can see the value of A is 1. We say that there is a relationship between both 1s in the group and the value of A; both 1s in the group match their column heading. Now look at the ROW headings for each 1 in the group. For the top 1 in the group, the row headings are B = 0 and C = 0. For the bottom 1 in the group, the row headings are B = 1 and C = 0. For now, consider only the C row heading. The value of C in the row heading is 0 for both 1s in the group, so there IS a relationship between both 1s in the group and the value of C; they are always opposite (NOT each other). However, the value of B in the row heading is 0 for the top 1 in the group and the value of B in the row heading is 1 for the bottom 1 in the group, so they are unrelated. This leads to the expression A AND NOT C.
exam in 12 hours, and this video is godsend
@ComputerScienceLessons
4 жыл бұрын
All the very best of luck. :)KD
thank you so much
Explained well.
@ComputerScienceLessons
5 жыл бұрын
Tnx
This video is great
@ComputerScienceLessons
Жыл бұрын
Thank you :)KD
at 10:50 , you did not mention C at all, is it because the group is vertical or you just assumed we understand C can be dismissed since values in the group didnt change whether C was 0 or 1?
@ComputerScienceLessons
6 жыл бұрын
Hi Zanas Tumasonis - I assumed you understood that C can be dismissed since values in the group didn't change whether C was 0 or 1. The top 1 in the group corresponds to an input value of of 0 for C and the bottom 1 in the group corresponds to an input value of of 1 for C, so the output is independent of C.
Thank you ❤
@ComputerScienceLessons
Жыл бұрын
You're welcome :)KD