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.
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.
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.
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.
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
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.
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.
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
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!
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
(NOT A) OR (NOT B) is equivalent to NOT (A AND B), which is a NAND gate. (NOT A) AND (NOT B) is equivalent to NOT (A OR B), which is a NOR gate. This is known as Demorgan's theorem. :)KD
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.
![F.HERO Ft. JSPKK x ลำไย ไหทองคำ x M-PEE - ไม่สนิทบิดหมด (Thai Riders Anthem) [Official MV]](http://i.ytimg.com/vi/kPJZ0UihBfk/mqdefault.jpg)
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 .
It's my pleasure :)KD
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.
Thanks a million. Really appreciated :)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.
These problems fried my circuits, smh. Who thought of this?
@@KrestenGiese karnaugh
@@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.
thank god... finally a tutorial that I can understand the tutor...
My problem with basically all TH-cam CS content 😐😂
@Oliver Fong - Amen. You took the words out of my mouth!
@@d-thec-tieve4648 seriously...
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.
@@damarigeorge1412 try forgot password doofus.
Calm voice and clear diction makes this video enjoyable, thank you !
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 by far the EASIEST explanation of the k-map! Thanks a lot! You got my sub!
This is a great video. Sir, you have added value to the world.
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.
Thank you for the lovely comment. :)KD
As soon as i wathced the video i subscribed for the crystal-clear explanation and quality of your videos. Nice work.
The best video I have found on the topic even in 2024.. thank yu
crystal clear introduction, im sure ill have no problem following my professor when this gets brought up in lecture
Thank you. I hope you stay ahead of the game :)KD
Great explanation easy to understand. Much faster and more concise than any I've come across.
Good to hear. Thanks :)KD
I just got a 83% for my exam because of your video, thanks alot!
This series is the best presentation on this topic I've seem. Thank u
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!
You're welcome. Thanks a million for the lovely comment. :) KD
great video sir. refreshing to hear an english accent teach stuff like this on yt
Thank you :)KD
This is the great video for saving a lot of life.
Thank you for this! I’m in a Digital Electronics Class (PLTW Engineering) and I have an exam tomorrow!
Good luck :)KD
Thanks a lot, i have an exam in like 12 hours and i'm studying the entire semester right now. Thank you
You're pushing it. Good luck. Stay positive. :)KD
So ?
@@IStMl?
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!!
Best K-map tutorial so far. Excellent stuff and many thanks.
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.
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
The best video tutorial about Karnaugh Maps! I'm taking an exam in 2 hours.
I hope the exam went well.
best teaching I ever had!
Wow - thanks :)KD
This video is a true treasure!!
Brilliant explanation and fabulously presented.
Thank you.
I agree with Oliver Best Tutorial no one explained before that Karnaugh Maps were layed out in Gray Code!
Thank you :)KD
Thank you for the beautifully executed resource on this subject.
You saved my life, thank you sir.
Best tutorial for K-maps ever!
Thanks for saying so. :) KD
Very clear explanation and tons of examples, thank you!
Excellent and Thorough!
Clear and totally understandable and quick
Thank you :)KD
Good and clear explanation about K-Map. Thankyou
Thank you :)KD
Sir I think you've dropped this : 👑
I lost one of those playing Fortnite. Thanks :)KD
Stunning job . Well done and thank you very much .
You comment is much appreciated. Thanks.
very good explanation and great examples, thank you
You're welcome :)KD
This man just gave me an A in my digital logic course with one video 🗿
You did it yourself - but glad to help. :)KD
Computer Science :D
gg
A very good explanation! Thankyou!!
You are welcome!
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!
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
Really awesome video, clear and concise. Thank you!
very good tutorial. your an excellent teacher
my god thank you so much for this clear explanation, was going crazy stuck on this
You're very welcome. Glad to help :)KD
best explanation for me thank you !!
You are welcome. Thanks a million. :)
this guys vids are too good
This guy thanks you :)KD
you should consider narrating an audiobook
Thank you, I have an exam tomorrow and this cleared everything up!
Thanks a lot sir for the so easily understandable presentation!!
You're very welcome :)KD
Excellent explanation. Thank you!!!!
Apun inspection, this video is great! Thanks!
Amazing explanation. Thank you!!
You're very welcome. Thanks :)KD
Holy shit man, god of tutorials, nice.
Good to hear. Thanks :)KD
this is a *stellar* video...thanks very very much 🙏
Thank YOU. :)KD
Thank you sir for Excellent explaination with good examples.
exam in 12 hours, and this video is godsend
All the very best of luck. :)KD
Thank you! This was great!
Thanks! Beautiful explanations!
Thanks for saying so. :)KD
You have won my like and my respect, thanks a lot!
This was good but I really wish you'd describe the difference between minterm and maxterm and give examples using that terminology.
I am so grateful to you!!
I just want to clarify, not A OR not B is a NOR Gate, but since both A and B are not presented, this is indeed a NAND gate.
(NOT A) OR (NOT B) is equivalent to NOT (A AND B), which is a NAND gate. (NOT A) AND (NOT B) is equivalent to NOT (A OR B), which is a NOR gate. This is known as Demorgan's theorem. :)KD
this channel's name man, i hope someone creates a math channel too that teaches it
I wish I had time. This website is really good though. betterexplained.com/
how can someone be that smart to invent this?
I must agree. Some of the ideas and techniques you come across are simply beautiful. :)KD
Very good explanation!!
Thanks so much for making this nice and clear
You are very welcome :)KD
Good explanation. Thank you so much.
fantastic video, very clear and thorough.
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.
You do a great job teaching this stuff!
Thank you :)KD
thank you so much its very easy to understand
You're welcome.
Thank you so much, sir!
You are very welcome :)KD
thanks sir. best tutorial ever
This was really helpful, thanks a lot!
Thanks a lot, this is amazing.
You're very welcome :)KD
n.b. "few groups rule" takes precedence over "large groups rule"
Indeed :)KD
Thank you! This was helpful.
Great summary
Absolutely fantastic. Thanks a lot.
good video, old but high quality!
Tq so much sir. U help me so much 👍
:) KD
Great video!
Thank you :)KD
Brilliant, thanks.
You're most welcome :)KD
Thank you, explained so well and clear!
Thanks, it is so easy to understand.
Thank you sir.
And thank you for the comment. :) KD
Explained well.
Tnx
This video is great
Thank you :)KD
What if there is unknown, x. Then what is the Boolean equation would be for x?
simple and effective 😊😊
Tnx :) KD
Who else thinks this man sounds like Jonathan Ive, the Chief Design Officer from Apple??? Btw thank you for the great tutorial!
Thank you thank you!
You are most welcome :)KD
Thank You Sir!
You are welcome. :) KD
Thank you ❤
You're welcome :)KD
you are the best♥
Much appreciated. Thanks a million :)KD
Thank you! It helped me a lot😃
Excellent
Thank you :)KD
Thank you sir!!!!!!! you literally saved my life!
Now don't exaggerate. I'm glad I could help though. :)KD