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

[@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

[@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.

[@mydogbullwinkle]

Amen to that!

[@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.

[@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.

[@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

[@leonvalabregue6414]

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

[@BluePaperUmbrella]

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

[@Official_FireGuy]

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

[@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

[@edumeli02]

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

[@SuperRyMac]

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

[@geoffparsons1952]

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

[@ComputerScienceLessons]

Good to hear. Thanks :)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

[@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

[@hi788-n7x]

This series is the best presentation on this topic I've seem. Thank u

[@boySlowsteady]

Today after a lot of struggling to experience "methodology" learning, I found that "simple teaching" comes from number of failed attempts. I liked the video because I sensed the teaching wasn't sharing pre-planned content. all were taught during the teaching. Liked it.

[@RichardWalterLanda]

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

[@usharaperera77]

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!!

[@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?

[@Drone360pilot]

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

[@mohammedjarvis5818]

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

[@ComputerScienceLessons]

Thank you :)KD

[@shek23838827]

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

[@Vayanovic]

Best K-map tutorial so far. Excellent stuff and many thanks.

[@zongzheli1283]

The best video tutorial about Karnaugh Maps! I'm taking an exam in 2 hours.

[@ComputerScienceLessons]

I hope the exam went well.

[@gracemoss4516]

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

[@ComputerScienceLessons]

Good luck :)KD

[@Malajmi97]

This video is a true treasure!! Brilliant explanation and fabulously presented. Thank you.

[@allielee3952]

best teaching I ever had!

[@ComputerScienceLessons]

Wow - thanks :)KD

[@morsecode9223]

You saved my life, thank you sir.

[@dkalogirou]

Stunning job . Well done and thank you very much .

[@ComputerScienceLessons]

You comment is much appreciated. Thanks.

[@k.subathra9236]

Good and clear explanation about K-Map. Thankyou

[@ComputerScienceLessons]

Thank you :)KD

[@perryboctone1]

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

[@ComputerScienceLessons]

Thank you :)KD

[@NasifIstiak]

Very clear explanation and tons of examples, thank you!

[@drunkenfarmer2513]

Thank you, I have an exam tomorrow and this cleared everything up!

[@shaadhussain7280]

Really awesome video, clear and concise. Thank you!

[@naturalglory]

Thank you for the beautifully executed resource on this subject.

[@c-apsl-ock]

best explanation for me thank you !!

[@ComputerScienceLessons]

You are welcome. Thanks a million. :)

[@ahmedtamer4620]

Best tutorial for K-maps ever!

[@ComputerScienceLessons]

Thanks for saying so. :) KD

[@manideepak2605]

Thank you sir for Excellent explaination with good examples.

[@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

[@robbiegill864]

very good tutorial. your an excellent teacher

[@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

[@cristigheorghiu2]

Holy shit man, god of tutorials, nice.

[@ComputerScienceLessons]

Good to hear. Thanks :)KD

[@Sword1918]

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

[@josiahjoel7580]

very good explanation and great examples, thank you

[@ComputerScienceLessons]

You're welcome :)KD

[@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

[@semihdyngyldai1895]

Sir I think you've dropped this : 👑

[@ComputerScienceLessons]

I lost one of those playing Fortnite. Thanks :)KD

[@Aakancha_Verma]

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

[@ComputerScienceLessons]

You're very welcome :)KD

[@frant.8768]

Apun inspection, this video is great! Thanks!

[@artie5172]

A very good explanation! Thankyou!!

[@ComputerScienceLessons]

You are welcome!

[@sungilcho7821]

Clear and totally understandable and quick

[@ComputerScienceLessons]

Thank you :)KD

[@rajinthss7732]

Excellent and Thorough!

[@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

[@cocothetimeless8382]

this guys vids are too good

[@ComputerScienceLessons]

This guy thanks you :)KD

[@bradsmith2058]

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

[@ComputerScienceLessons]

Thank YOU. :)KD

[@zZBlitzZz]

exam in 12 hours, and this video is godsend

[@ComputerScienceLessons]

All the very best of luck. :)KD

[@arianemachado343]

Amazing explanation. Thank you!!

[@ComputerScienceLessons]

You're very welcome. Thanks :)KD

[@ryanevans5211]

fantastic video, very clear and thorough.

[@siradamkhan6505]

Excellent explanation. Thank you!!!!

[@md.sabbirahmed7494]

Good explanation. Thank you so much.

[@katekyojp6338]

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...

[@jennyggf3556]

Very good explanation!!

[@Ali-wl6pm]

This was really helpful, thanks a lot!

[@exodia_right_leg]

Thanks! Beautiful explanations!

[@ComputerScienceLessons]

Thanks for saying so. :)KD

[@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

[@zanastumasonis]

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]

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.

[@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/

[@NA12495]

You do a great job teaching this stuff!

[@ComputerScienceLessons]

Thank you :)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

[@zukiair3760]

Thanks so much for making this nice and clear

[@ComputerScienceLessons]

You are very welcome :)KD

[@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.

[@s.kumarihamy4077]

thanks sir. best tutorial ever

[@ghastlywhispers1637]

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

[@chethannl7810]

simple and effective 😊😊

[@ComputerScienceLessons]

Tnx :) KD

[@runo8]

Absolutely fantastic. Thanks a lot.

[@stelity]

Thank you! This was helpful.

[@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

[@jhabiznourmohammadi1142]

Thank you! This was great!

[@danielsalim4149]

Thanks, it is so easy to understand.

[@유재호-y1v]

thank you so much its very easy to understand

[@ComputerScienceLessons]

You're welcome.

[@flukymaze]

at 5:35 how is the numbers opposite of the table if its not opposite

[@ComputerScienceLessons]

At 5:35, I point out that there is a horizontal group of 1s in the K-map (highlighted in red) and that these are the 'opposite' of the row label which is 0 (also in red). I am saying that 0 is the opposite of 1. I hope this makes sense.

[@flukymaze]

@@ComputerScienceLessons fanks i rewatched the video now everything makes sense

[@MAWANMUHAMMADAMMAR]

Tq so much sir. U help me so much 👍

[@ComputerScienceLessons]

:) 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

[@krishna9438]

Thank you! It helped me a lot😃

[@njbrx]

you should consider narrating an audiobook

[@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.

[@lumerify]

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

[@ComputerScienceLessons]

Indeed :)KD

[@XOceaNX]

I am so grateful to you!!

[@mraristocrat1074]

Thanks a lot, this is amazing.

[@ComputerScienceLessons]

You're very welcome :)KD

[@lumerify]

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

[@ComputerScienceLessons]

:)KD

[@vickyk2447]

is it just me or are the values on this kmap 7:26 wrong? someone please help

[@ComputerScienceLessons]

As long as the values on the kmap match the truth table, they are correct. I've double checked this, they look OK to me. Beware however, the row labels are unusual; they are written in Reflected Binary Code (AKA Gray code). :)KD

[@vickyk2447]

@@ComputerScienceLessons oh yeah i see your point. thank you!

[@benmontgomery1111]

Great video!

[@ComputerScienceLessons]

Thank you :)KD

[@leetcodeespanol59]

good video, old but high quality!

[@elshazlio]

Great summary

[@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.

[@nidzeksmocni659]

Thank you so much, sir!

[@ComputerScienceLessons]

You are very welcome :)KD

[@nima7605]

you are the best♥

[@ComputerScienceLessons]

Much appreciated. Thanks a million :)KD

[@hanif2285]

Thank you sir!!!!!!! you literally saved my life!

[@ComputerScienceLessons]

Now don't exaggerate. I'm glad I could help though. :)KD