This video follows on from the previous videos about Karnaugh maps. It explains how Karnaugh maps, and truth tables, can be used to simplify complex Boolean expressions.
I found them pointless and annoying until I did some stuff setting up a 7 segment display for a BCD and they really helped. It was just hard enough a problem to make the K-map worthwhile. PS: excellent videos, thanks CS. Concise, clear & correct.
I'm here at the end of the last video on the playlist, and I have no words to describe how much you helped me! Your videos are extremely organized and well explained, thank you very much.
I have a rubber stamp (from my days at Bell Labs in the 1960's) that produces a 16 Cell Karnaugh Map on a piece of paper. I have tried selling it on Ebay, but alas, no one knows what it is!
Though I don't quite understand what it is, I am really interested to see what it looks like, do you have the link for that stamp(Sorry that I didn't see that comment 2 years ago.)
Hope it's ok to ask a quick question about simplification -- I'm able to reduce A’B + BC’ + BC + AB’C’ to B + AB’C’ What's the next step to get to B + AC’? Thanks! Great videos!
Hi. If there was a horizontal group, there would be 3 groups. One of the rules of grouping is that there should be as few groups as possible (see the summary at the end of th-cam.com/video/3vkMgTmieZI/w-d-xo.html) :) KD
What on earth happened to the 'normal' way of writing logic as in 'bar' for negation and + for OR ? The above seems *more* complicated for no reason or gain.
I've used the same convention as a number of text books on the subject. Over-scoring a term to indicate negation is tricky with simple text, but I can type AND (^) OR (v) and NOT (¬) quite easily. :)KD
Each group should be as large as possible and there should be as few groups as possible. Grouping the two one under each other would have resulted in 3 groups instead of only 2. :)KD
I am actually starting to enjoy completing Karnaugh Maps. It is like a more useful version of Sudoku.
Great comment. Thanks. :)
I found them pointless and annoying until I did some stuff setting up a 7 segment display for a BCD and they really helped. It was just hard enough a problem to make the K-map worthwhile. PS: excellent videos, thanks CS. Concise, clear & correct.
get a life
you took stuff that at times looked like nonsense and made it so simple! Thank you.
Delighted to help. You are most welcome :)KD
Thank you sir, your videos cannot be more precise and comprehensive at the same time, I've learned here more than in college.
Excellent explanation. I found your videos very useful to learn K maps and help a college student. You speak clearly and slowly.
I'm here at the end of the last video on the playlist, and I have no words to describe how much you helped me! Your videos are extremely organized and well explained, thank you very much.
You're very welcome. And than you :)KD
My finals in discrete math is appearing and this video has been super helpful!
Good to hear. :) KD
This is a very good explanation for k-maps
thank you sir!
Thank you. You're very welcome :)KD
I have a rubber stamp (from my days at Bell Labs in the 1960's) that produces a 16 Cell Karnaugh Map on a piece of paper. I have tried selling it on Ebay, but alas, no one knows what it is!
Sounds fascinating. Could you post a picture? I used to have a stencil for drawing logic gates - I can't believe the price of them now.
Though I don't quite understand what it is, I am really interested to see what it looks like, do you have the link for that stamp(Sorry that I didn't see that comment 2 years ago.)
Well explained! Progressing through 3 examples really made sense.
Delighted to help :)KD
Absolutely brilliant - so well explained - thank you so very much!🙂
You're very welcome :)KD
Thanks a lot for this video ! I was struggling with these maps, but it's crystal clear now.
Delighted to help. I struggled with these at first then I realised the text book I was reading was wrong! :)KD
simple and very clear explanations. Thank you .
You are very welcome :)KD
Better than my extremely expensive university ...thank u
Thanks a lot
You're very welcome. Thanks for the lovely comment. :)KD
Woah mindblown how easy it is. Thank you very much for the clear explanation
The light bulb moment. :)
Great series! You have been a great help.
Amazing teaching . Thank you for helping me learn!
You are most welcome. Thanks for commenting :)KD
the way you taught, is super owesum, thank u so much
You are very welcome. Thanks for the lovely comment. :) KD
this is the best channel ever
Thank you for this! This really helped me understand K Maps and their uses.
This helped me a lot.Thanks for your dedication :)
Thanks finally for a clear explanation
You just saved me for my homework thanks lots!
Happy to help. :)KD
You are fantastic, continue bro.
Thank you :)KD
Very clear thank u😟
Thank you so much, Sir.
You are very welcome :)KD
Hope it's ok to ask a quick question about simplification --
I'm able to reduce A’B + BC’ + BC + AB’C’
to B + AB’C’
What's the next step to get to B + AC’?
Thanks! Great videos!
Lol ignored
It so good I understood it very clearly thank u so mucch for video
Hi! Why didn’t you also select vertical overlapping group at 5:43?
Hi. If there was a horizontal group, there would be 3 groups. One of the rules of grouping is that there should be as few groups as possible (see the summary at the end of th-cam.com/video/3vkMgTmieZI/w-d-xo.html) :) KD
Computer Science Thanks!
Love you from Italy
Thank you, very helpful!
thank you
Tnx. Great name BTW.
Thank you so much!!
What on earth happened to the 'normal' way of writing logic as in 'bar' for negation and + for OR ? The above seems *more* complicated for no reason or gain.
I've used the same convention as a number of text books on the subject. Over-scoring a term to indicate negation is tricky with simple text, but I can type AND (^) OR (v) and NOT (¬) quite easily. :)KD
nice things
Why aren’t ABC’ and ABC (the third column) not grouped together?
At which point in the video are you referring?
The grouping rules are summarised at the end of this video:
th-cam.com/video/3vkMgTmieZI/w-d-xo.html
in 5:44 why didn't you group up the two ones under each other ?????
Each group should be as large as possible and there should be as few groups as possible. Grouping the two one under each other would have resulted in 3 groups instead of only 2. :)KD
@@ComputerScienceLessons ohhhh okay now i get it thanksssssss
🎉🎉❤
Sir, if there are T and F what can I do? Please help me🙏🏽
No difference. Just assume T = 1 and F = 0
:)KD
@@ComputerScienceLessons Ok Sir. Thank you very much.Lots of love and respect to you🙏🏽❤
What about hazards
So called 'static hazards' can be identified using K-maps. I hope to cover this one day.