Karnaugh Maps - Introduction 

It's my pleasure :)KD

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

My problem with basically all RU-vid 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.

Thank you for the lovely comment. :)KD

Good to hear. Thanks :)KD

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

Thanks a million. Really appreciated :)KD

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

You comment is much appreciated. Thanks.

Thank you :)KD

You are welcome. Thanks a million. :)

You're very welcome :)KD

You're welcome :)KD

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

So ?

@@IStMl?

Good luck :)KD

You're very welcome. Thanks :)KD

You're very welcome. Glad to help :)KD

Thanks for saying so. :)KD

Thank you :)KD

Thanks for saying so. :) KD

Wow - thanks :)KD

Thank you :)KD

Thank YOU. :)KD

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

Thank you :)KD

Please take a look at my playlist on Logic Gates.

This guy thanks you :)KD

Thank you :)KD

I hope the exam went well.

Good to hear. Thanks :)KD

You are very welcome :)KD

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

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

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

All the very best of luck. :)KD

You're welcome.

You are very welcome :)KD

Thank you :)KD

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

Computer Science :D

gg

Tnx

:) KD

You're welcome :)KD

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.

Thanks for the comment. I love the cat.

You're most welcome :)KD

You are most welcome :)KD

Thank you :)KD

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.

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