Karnaugh Maps - Introduction

No video

Karnaugh Maps - Introduction

Рет қаралды 419,515

Computer Science

Күн бұрын

Пікірлер: 280

@ahmedbahaj8786 3 жыл бұрын

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

@norcal6181 5 жыл бұрын

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 7 ай бұрын

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

@ronalddaugherty 5 жыл бұрын

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.

@justingolden21 4 жыл бұрын

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.

@igdivine5389 6 ай бұрын

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 6 ай бұрын

Thanks a million. Really appreciated :)KD

@oliverfong418 6 жыл бұрын

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

@d-thec-tieve4648 4 жыл бұрын

My problem with basically all KZfaq CS content 😐😂

@NotMarkKnopfler 4 жыл бұрын

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

@0x44Monad 3 жыл бұрын

@@d-thec-tieve4648 seriously...

@damarigeorge1412 3 жыл бұрын

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.

@wahidhamidy6886 6 жыл бұрын

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 5 жыл бұрын

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

@BluePaperUmbrella 5 жыл бұрын

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

@SuperRyMac 5 жыл бұрын

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

@Official_FireGuy 6 жыл бұрын

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

@MsThekiller02 3 жыл бұрын

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

@asherorourke6199 4 жыл бұрын

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

@mohammedjarvis5818 4 ай бұрын

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

@ComputerScienceLessons 3 ай бұрын

Thank you :)KD

@geoffparsons1952 4 жыл бұрын

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

@ComputerScienceLessons 4 жыл бұрын

Good to hear. Thanks :)KD

@ro-ce8vg 2 жыл бұрын

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

@asf1062 4 жыл бұрын

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

@s.m.h.m8804 Жыл бұрын

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

@mattmurdock2259 4 жыл бұрын

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?

@shek23838827 5 жыл бұрын

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

@usharaperera77 3 жыл бұрын

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

@Drone360pilot 11 ай бұрын

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

@gracemoss4516 3 жыл бұрын

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

@ComputerScienceLessons 3 жыл бұрын

Good luck :)KD

@zongzheli1283 6 жыл бұрын

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

@ComputerScienceLessons 6 жыл бұрын

I hope the exam went well.

@bpenaval2541 3 жыл бұрын

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

@Vayanovic 5 жыл бұрын

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

@perryboctone1 3 жыл бұрын

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

@ComputerScienceLessons 3 жыл бұрын

Thank you :)KD

@semihdyngyldai1895 7 ай бұрын

Sir I think you've dropped this : 👑

@ComputerScienceLessons 7 ай бұрын

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

@Malajmi97 5 жыл бұрын

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

@morsecode9223 4 жыл бұрын

You saved my life, thank you sir.

@allielee3952 3 жыл бұрын

best teaching I ever had!

@ComputerScienceLessons 3 жыл бұрын

Wow - thanks :)KD

@methanesulfonic 2 жыл бұрын

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

@c-apsl-ock 5 жыл бұрын

best explanation for me thank you !!

@ComputerScienceLessons 5 жыл бұрын

You are welcome. Thanks a million. :)

@cocothetimeless8382 2 жыл бұрын

this guys vids are too good

@ComputerScienceLessons 2 жыл бұрын

This guy thanks you :)KD

@artie5172 Жыл бұрын

A very good explanation! Thankyou!!

@ComputerScienceLessons Жыл бұрын

You are welcome!

@k.subathra9236 Жыл бұрын

Good and clear explanation about K-Map. Thankyou

@ComputerScienceLessons Жыл бұрын

Thank you :)KD

@drunkenfarmer2513 5 жыл бұрын

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

@vivadecuervo 6 жыл бұрын

Stunning job . Well done and thank you very much .

@ComputerScienceLessons 6 жыл бұрын

You comment is much appreciated. Thanks.

@sandman.38 4 жыл бұрын

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

@ComputerScienceLessons 4 жыл бұрын

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

@sandman.38 4 жыл бұрын

Computer Science :D

@Robotomy101 Жыл бұрын

@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

@NasifIstiak 5 жыл бұрын

Very clear explanation and tons of examples, thank you!

@zZBlitzZz 4 жыл бұрын

exam in 12 hours, and this video is godsend

@ComputerScienceLessons 4 жыл бұрын

All the very best of luck. :)KD

@sungilcho7821 3 жыл бұрын

Clear and totally understandable and quick

@ComputerScienceLessons 3 жыл бұрын

Thank you :)KD

@ahmedtamer4620 4 жыл бұрын

Best tutorial for K-maps ever!

@ComputerScienceLessons 4 жыл бұрын

Thanks for saying so. :) KD

@shaadhussain7280 5 жыл бұрын

Really awesome video, clear and concise. Thank you!

@rajinthss7732 5 жыл бұрын

Excellent and Thorough!

@josiahjoel7580 Жыл бұрын

very good explanation and great examples, thank you

@ComputerScienceLessons Жыл бұрын

You're welcome :)KD

@naturalglory Жыл бұрын

Thank you for the beautifully executed resource on this subject.

@AlexandrBorschchev 4 жыл бұрын

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/

@manideepak2605 5 жыл бұрын

Thank you sir for Excellent explaination with good examples.

@robbiegill864 4 жыл бұрын

very good tutorial. your an excellent teacher

@cristigheorghiu2 4 жыл бұрын

Holy shit man, god of tutorials, nice.

@ComputerScienceLessons 4 жыл бұрын

Good to hear. Thanks :)KD

@jhabiznourmohammadi1142 3 жыл бұрын

Thank you! This was great!

@frant.8768 5 жыл бұрын

Apun inspection, this video is great! Thanks!

@Aakancha_Verma 3 жыл бұрын

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

@ComputerScienceLessons 3 жыл бұрын

You're very welcome :)KD

@impakgensin1637 4 жыл бұрын

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

@Sword1918 5 жыл бұрын

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

@AlexandrBorschchev 4 жыл бұрын

how can someone be that smart to invent this?

@ComputerScienceLessons 4 жыл бұрын

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

@bradsmith2058 3 жыл бұрын

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

@ComputerScienceLessons 3 жыл бұрын

Thank YOU. :)KD

@XOceaNX Жыл бұрын

I am so grateful to you!!

@ryanevans5211 6 жыл бұрын

fantastic video, very clear and thorough.

@caroe.3237 5 жыл бұрын

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

@jennyggf3556 5 жыл бұрын

Very good explanation!!

@abaundwal 4 жыл бұрын

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.

@md.sabbirahmed7494 5 жыл бұрын

Good explanation. Thank you so much.

@Ali-wl6pm 5 жыл бұрын

This was really helpful, thanks a lot!

@exodia_right_leg 4 жыл бұрын

Thanks! Beautiful explanations!

@ComputerScienceLessons 4 жыл бұрын

Thanks for saying so. :)KD

@lumerify 10 ай бұрын

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

@ComputerScienceLessons 10 ай бұрын

:)KD

@NA12495 2 жыл бұрын

You do a great job teaching this stuff!

@ComputerScienceLessons 2 жыл бұрын

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

@zukiair3760 2 жыл бұрын

Thanks so much for making this nice and clear

@ComputerScienceLessons 2 жыл бұрын

You are very welcome :)KD

@leetcodeespanol59 2 жыл бұрын

good video, old but high quality!

@stelity 5 жыл бұрын

Thank you! This was helpful.

@benmontgomery1111 2 жыл бұрын

Great video!

@ComputerScienceLessons 2 жыл бұрын

Thank you :)KD

@OsarueseOkungbowa 2 ай бұрын

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

@s.kumarihamy4077 5 жыл бұрын

thanks sir. best tutorial ever

@nidzeksmocni659 3 жыл бұрын

Thank you so much, sir!

@ComputerScienceLessons 3 жыл бұрын

You are very welcome :)KD

@doubleG333 4 жыл бұрын

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

@mraristocrat1074 2 жыл бұрын

Thanks a lot, this is amazing.

@ComputerScienceLessons 2 жыл бұрын

You're very welcome :)KD

@lumerify 10 ай бұрын

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

@ComputerScienceLessons 10 ай бұрын

Indeed :)KD

@user-nz9kx5js6h 4 жыл бұрын

thank you so much its very easy to understand

@ComputerScienceLessons 4 жыл бұрын

You're welcome.

@elshazlio 2 жыл бұрын

Great summary

@katekyojp6338 6 жыл бұрын

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

@FREDRICKMUTHOMI Жыл бұрын

This video is great

@ComputerScienceLessons Жыл бұрын

Thank you :)KD

@hcbros105 5 жыл бұрын

Explained well.

@ComputerScienceLessons 5 жыл бұрын

Tnx

@MAWANMUHAMMADAMMAR 4 жыл бұрын

Tq so much sir. U help me so much 👍

@ComputerScienceLessons 4 жыл бұрын

:) KD

@zanastumasonis 6 жыл бұрын

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.

@nima7605 Жыл бұрын

you are the best♥

@ComputerScienceLessons Жыл бұрын

Much appreciated. Thanks a million :)KD

@mattking5129 Жыл бұрын

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

@KennethDonahue 3 жыл бұрын

Thank you thank you!

@ComputerScienceLessons 3 жыл бұрын

You are most welcome :)KD

@danielsalim4149 6 жыл бұрын

Thanks, it is so easy to understand.

@attilaweisz2020 3 жыл бұрын

Brilliant, thanks.

@ComputerScienceLessons 3 жыл бұрын

You're most welcome :)KD

@HeskeyBoy21 5 жыл бұрын

Thank you, explained so well and clear!

@juzefzoozoo 4 жыл бұрын

Thank you sir.

@ComputerScienceLessons 4 жыл бұрын

And thank you for the comment. :) KD

@tendaijakutindi4175 Жыл бұрын

Thank you ❤

@ComputerScienceLessons Жыл бұрын

You're welcome :)KD

@Flooshawoosh 3 жыл бұрын

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

@ComputerScienceLessons 3 жыл бұрын

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

@chethannl7810 4 жыл бұрын

simple and effective 😊😊

@ComputerScienceLessons 4 жыл бұрын

Tnx :) KD

@trungnghianguyen 5 жыл бұрын

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

@ComputerScienceLessons 5 жыл бұрын

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

@MahmoodHussain1818 2 жыл бұрын

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.