Boolean Algebra: Karnaugh Maps

What are Karnaugh Maps and how are they used to convert truth tables to boolean equations. This tutorial explains how to solve digital logic problems with multiple variables.

[@cjm101]

this video helped me a lot! many thanks

[@pavangovu]

Loved it, thank you!

[@dlight3084]

You just saved a life sir I really respect that

[@oggiai]

LoL. Good luck my friend!

[@ilyasabi8920]

This is great by could you include the explanation of why we use the gray bit order then this would be complete as a learning material.

[@georgemusonda4163]

great stuff really educative!!!

[@evereststudios2347]

Amazing 🤩

[@eduardocambiaso9579]

Hey Joe, at 7:50 yo k map is wrong, the position where ABCD = (00001) is actually zero on the table, but in the k map it says it's one, and the position where ABCD = (0100) should be one according to the table but the map says otherwise

[@oggiai]

+Eduardo Cambiaso thanks, I’ll check it out and try to edit.

[@jimmyprocida829]

@@oggiai 2 years apparently passed, but the result is still the same. So is the K-Map correct or not? because I was actually wondering the same thing as he did and I found this comment here! The rest is awesome, simple and straight forward!

[@jimmyprocida829]

Shouldn't the output in the K-map be like this:
1101
0001
0000
0110
?

[@bwimpenn]

@@jimmyprocida829 that's what i got...

[@jimmyprocida829]

@@bwimpenn what have you got?

[@jasongrembi]

At time frame 11:07 the bit flips from 0 to 1 for for row A'B'C' why?

[@astrologyfit]

Excellent. This one is a jewel given the load of crap that is circulating on TH-cam in the name of k-map in my country India.

[@finncollins5696]

🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣