Karnaugh Maps - Introduction

[@ahmedbahaj8786]

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]

It's my pleasure :)KD

[@norcal6181]

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]

These problems fried my circuits, smh. Who thought of this?

[@AlexandrBorschchev]

@@KrestenGiese karnaugh

[@emperor8716]

@@AlexandrBorschchevactually made me LOL. but anyway i gotta thank Karnaugh cuz this is better than SOP or POS

[@oliverfong418]

thank god... finally a tutorial that I can understand the tutor...

[@d-thec-tieve4648]

My problem with basically all KZbin CS content 😐😂

[@NotMarkKnopfler]

@Oliver Fong - Amen. You took the words out of my mouth!

[@0x44Monad]

@@d-thec-tieve4648 seriously...

[@damarigeorge1412]

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]

@@damarigeorge1412 try forgot password doofus.

[@justingolden21]

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.

[@ronalddaugherty]

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.

[@jemskies3781]

You sound like the computer voice of courage the cowardly dog lol. But hey you have help me! Thank you so much :D

[@BluePaperUmbrella]

This is a great video. Sir, you have added value to the world.

[@wahidhamidy6886]

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

[@SuperRyMac]

I just got a 83% for my exam because of your video, thanks alot!

[@asherorourke6199]

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]

Thank you for the lovely comment. :)KD

[@Official_FireGuy]

This is by far the EASIEST explanation of the k-map! Thanks a lot! You got my sub!

[@leonvalabregue6414]

Calm voice and clear diction makes this video enjoyable, thank you !

[@c-apsl-ock]

best explanation for me thank you !!

[@ComputerScienceLessons]

You are welcome. Thanks a million. :)

[@igdivine5389]

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]

Thanks a million. Really appreciated :)KD

[@lumerify]

n.b. "few groups rule" takes precedence over "large groups rule"

[@ComputerScienceLessons]

Indeed :)KD

[@edumeli02]

As soon as i wathced the video i subscribed for the crystal-clear explanation and quality of your videos. Nice work.

[@lumerify]

99.99% of viewers: this is better than my professor 0.001% of viewers: im 10 why am i here

[@ComputerScienceLessons]

:)KD

[@frant.8768]

Apun inspection, this video is great! Thanks!

[@thembelapatso9452]

enkosi mfondini ....iluncedo le ngcaciso yakho mfo....

[@ComputerScienceLessons]

Enkosi ngokugqabaza. I love the sound of your language :)KD

[@gracemoss4516]

Thank you for this! I’m in a Digital Electronics Class (PLTW Engineering) and I have an exam tomorrow!

[@ComputerScienceLessons]

Good luck :)KD

[@artie5172]

A very good explanation! Thankyou!!

[@ComputerScienceLessons]

You are welcome!

[@impakgensin1637]

What if there is unknown, x. Then what is the Boolean equation would be for x?

[@shek23838827]

This is the great video for saving a lot of life.

[@zZBlitzZz]

exam in 12 hours, and this video is godsend

[@ComputerScienceLessons]

All the very best of luck. :)KD

[@morsecode9223]

You saved my life, thank you sir.

[@abaundwal]

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.

[@codythompson9973]

Why in the hell is the ordering for the 11 and 10 switched in the kmaps?

[@ComputerScienceLessons]

It took me a while to get my head around this. It's called Grey code. Take a look at: en.wikipedia.org/wiki/Gray_code :)KD

[@codythompson9973]

@@ComputerScienceLessons Ah, that makes much more sense. I knew there was a good reason for it. Thank you. I just couldn't find a reasoning when I googled haha

[@sandman.38]

This man just gave me an A in my digital logic course with one video 🗿

[@ComputerScienceLessons]

You did it yourself - but glad to help. :)KD

[@sandman.38]

Computer Science :D

[@Robotomy101]

gg

[@asf1062]

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]

You're welcome. Thanks a million for the lovely comment. :) KD

[@mattmurdock2259]

Thanks a lot, i have an exam in like 12 hours and i'm studying the entire semester right now. Thank you

[@ComputerScienceLessons]

You're pushing it. Good luck. Stay positive. :)KD

[@IStMl]

So ?

[@yuhyuh5674]

@@IStMl?

[@xtechnopro8316]

Why the group must contain the largest number of ones ?

[@ComputerScienceLessons]

It doesn't necessarily have to, as long as all of the ones are included somehow. However, you may not end up with the SIMPLEST possible expression (although it may be correct). A later video in this series, and my series on Boolean Algebra, makes the point that we want to arrive at the simplest possible expression because it leads to the simplest (and therefore cheapest and most efficient) combination of logic gates :)KD

[@xtechnopro8316]

Computer Science thank you

[@jhabiznourmohammadi1142]

Thank you! This was great!

[@methanesulfonic]

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]

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

[@AlexandrBorschchev]

how can someone be that smart to invent this?

[@ComputerScienceLessons]

I must agree. Some of the ideas and techniques you come across are simply beautiful. :)KD

[@dkalogirou]

Stunning job . Well done and thank you very much .

[@ComputerScienceLessons]

You comment is much appreciated. Thanks.

[@bpenaval2541]

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]

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

[@manideepak2605]

Thank you sir for Excellent explaination with good examples.

[@perryboctone1]

I agree with Oliver Best Tutorial no one explained before that Karnaugh Maps were layed out in Gray Code!

[@ComputerScienceLessons]

Thank you :)KD

[@babyfefe999]

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

[@MAWANMUHAMMADAMMAR]

Tq so much sir. U help me so much 👍

[@ComputerScienceLessons]

:) KD

[@praisegeorge350]

you are too good

[@robbiegill864]

very good tutorial. your an excellent teacher

[@ardaydn939]

hocam konuyu anlatmadan ödev veriyorsunuz ayıp olmuyor mu biraz saygılar

[@ComputerScienceLessons]

Videolarımı mantık kapıları ve ardından Boole cebri ile ilgili izlemenizi öneririm. :)KD

[@k.subathra9236]

Good and clear explanation about K-Map. Thankyou

[@ComputerScienceLessons]

Thank you :)KD

[@ro-ce8vg]

crystal clear introduction, im sure ill have no problem following my professor when this gets brought up in lecture

[@ComputerScienceLessons]

Thank you. I hope you stay ahead of the game :)KD

[@mohammedjarvis5818]

great video sir. refreshing to hear an english accent teach stuff like this on yt

[@ComputerScienceLessons]

Thank you :)KD

[@josiahjoel7580]

very good explanation and great examples, thank you

[@ComputerScienceLessons]

You're welcome :)KD

[@RichardWalterLanda]

The best video I have found on the topic even in 2024.. thank yu

[@OsarueseOkungbowa]

What does he mean when he says the output of the k map is independent of a variable

[@mattking5129]

My map is different, on the left Column we put AB and c and not c on the top

[@LilikeNel]

super helpful thanks

[@ComputerScienceLessons]

You're very welcome. :)KD

[@md.sabbirahmed7494]

Good explanation. Thank you so much.

[@Drone360pilot]

Deep Respect and many many thanks for sharing knowledges in clean and extremely digestible format.God bless You !

[@bradsmith2058]

this is a *stellar* video...thanks very very much 🙏

[@ComputerScienceLessons]

Thank YOU. :)KD

[@MahmoodHussain1818]

I coud not understand the last example, could you please explain it or send any further link on the last example ??

[@ComputerScienceLessons]

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.

[@geoffparsons1952]

Great explanation easy to understand. Much faster and more concise than any I've come across.

[@ComputerScienceLessons]

Good to hear. Thanks :)KD

[@cocothetimeless8382]

this guys vids are too good

[@ComputerScienceLessons]

This guy thanks you :)KD

[@stelity]

Thank you! This was helpful.

[@rajinthss7732]

Excellent and Thorough!

[@Ali-wl6pm]

This was really helpful, thanks a lot!

[@Aakancha_Verma]

Thanks a lot sir for the so easily understandable presentation!!

[@ComputerScienceLessons]

You're very welcome :)KD

[@AlexandrBorschchev]

this channel's name man, i hope someone creates a math channel too that teaches it

[@ComputerScienceLessons]

I wish I had time. This website is really good though. betterexplained.com/

[@cristigheorghiu2]

Holy shit man, god of tutorials, nice.

[@ComputerScienceLessons]

Good to hear. Thanks :)KD

[@joysarkar3772]

from where or how the truth table has come? whats the operation?

[@ComputerScienceLessons]

Please take a look at my playlist on Logic Gates.

[@Bingcenzo]

6:46 Important detail

[@ComputerScienceLessons]

Indeed - it doesn't work without the Grey code. :)KD

[@shaadhussain7280]

Really awesome video, clear and concise. Thank you!

[@yassintaher4601]

يا رب تخش الاسلام يا معلم يا اسطوري

[@Flooshawoosh]

At 7:24, why is the BC listed as 00 01 11 10 instead of 00 01 10 11?

[@ComputerScienceLessons]

Take a look at: en.wikipedia.org/wiki/Gray_code :)KD

[@zukiair3760]

Thanks so much for making this nice and clear

[@ComputerScienceLessons]

You are very welcome :)KD

[@jennyggf3556]

Very good explanation!!

[@arianemachado343]

Amazing explanation. Thank you!!

[@ComputerScienceLessons]

You're very welcome. Thanks :)KD

[@FREDRICKMUTHOMI]

This video is great

[@ComputerScienceLessons]

Thank you :)KD

[@jlaltura9376]

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.

[@ComputerScienceLessons]

(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

[@njbrx]

you should consider narrating an audiobook

[@KennethDonahue]

Thank you thank you!

[@ComputerScienceLessons]

You are most welcome :)KD

[@calinopincariu5530]

Thank you!

[@ComputerScienceLessons]

You're welcome :)KD

[@sungilcho7821]

Clear and totally understandable and quick

[@ComputerScienceLessons]

Thank you :)KD

[@유재호-y1v]

thank you so much its very easy to understand

[@ComputerScienceLessons]

You're welcome.

[@nima7605]

you are the best♥

[@ComputerScienceLessons]

Much appreciated. Thanks a million :)KD

[@ishaklol375]

Thank u so much 🙏

[@ComputerScienceLessons]

You are very welcome. :)KD

[@NasifIstiak]

Very clear explanation and tons of examples, thank you!

[@hovsep56]

the left table on 6:18 does not make any sense it doesnt look like a and table or a or table or a xor table how do u know wich has the 1 result or 0 result of al the combinations

[@ComputerScienceLessons]

Hi hovsep56. The table on the left is a truth table for some combination of logic gates with 3 inputs. For all we know, it may be complex a combination of several logic gates (which someone has designed and is now hoping to simplify). We don't know what gates are involved, but we do know is how they behave, as described by the truth table. The K-Map analysis allows us to conclude it behaves like an OR gate with inputs A, B. (Ignore column C of this truth table and you will see this is the case.) K-Maps are a design tool that allow us to simplify circuits. In this example, we see that input C is actually superfluous and all we need is an OR gate with inputs A, B. :)KD

[@juzefzoozoo]

Thank you sir.

[@ComputerScienceLessons]

And thank you for the comment. :) KD

[@s.kumarihamy4077]

thanks sir. best tutorial ever

[@benmontgomery1111]

Great video!

[@ComputerScienceLessons]

Thank you :)KD

[@doubleG333]

when you say not a or not b, but the expression is A nand B, what's the expression? A + B or A * B ?

[@leetcodeespanol59]

good video, old but high quality!

[@Nex_Gen_Discover]

How we simply this expression F=AB+AC +BC With k-map

[@zainasif1089]

best tutorial

[@ComputerScienceLessons]

Thanks :)KD

[@tendaijakutindi4175]

Thank you ❤

[@ComputerScienceLessons]

You're welcome :)KD

[@Sword1918]

You have won my like and my respect, thanks a lot!

[@chinemelumj5349]

Omg, thank you so much🥰.

[@luigiinfanzon6798]

Who else thinks this man sounds like Jonathan Ive, the Chief Design Officer from Apple??? Btw thank you for the great tutorial!

[@caroe.3237]

This was good but I really wish you'd describe the difference between minterm and maxterm and give examples using that terminology.

[@trungnghianguyen]

so why do we need Kmap when we have the truth table already ?

[@ComputerScienceLessons]

You can derive or simplify a Boolean expression with a K-map.

[@naturalglory]

Thank you for the beautifully executed resource on this subject.

[@user-mj3ef]

How about a single cell you didnt give an example to it offfff

[@sudeeralowe8281]

good video!

[@ComputerScienceLessons]

Tnx :)KD

[@threshlantern7175]

nice video dude!

[@hcbros105]

Explained well.

[@ComputerScienceLessons]

Tnx