A full lesson within a 6 min.....just understood well!!! Thank you so much ......i have watched my teacher's recording too but I was unable to understand 💖
That's what I have trouble with. Basically you need to see which bits cancel out. For instance, if a grouping has one bit that is A'B and another bit that is AB, then the A cancels out leaving just B. Another way to look at it is if there is an odd number of one type of state and an even number of its complement, then that state is part of the final term. If there is an even number of a state and its complement, then that state gets cancelled out.
If the state changes then ignore it but if not count it. Look at the sets of two numbers together to the right of AB and below CD (i.e. 00, 01, 11, 10). For example - Red bit (AB and CD are changing states): AB AB 01 -----> 11 A goes from 0 to 1 (ignore it) B goes from 1 to 1 (keep it) ---> 1 = B CD CD 00 -----> 01 C goes from 0 to 0 (keep it) ---> 0 = C' D goes from 0 to 1 (ignore it) Final expression for red bit - BC' ________________________________________ Green bit (Only CD are changing states): AB AB 01 -----> 01 A goes from 0 to 0 (keep it) ---> 0 = A' B goes from 1 to 1 (keep it) ---> 1 = B CD CD CD CD 00 -----> 01 -----> 11 -----> 10 C goes from 0 to 0 to 1 to 1 (ignore it) D goes from 0 to 1 to 1 to 0 (ignore it) Final expression for green bit - A'B ________________________________________ Magenta bit (Only B is changing states): AB AB 00 -----> 01 A goes from 0 to 0 (keep it) ---> 0 = A' B goes from 0 to 1 (ignore it) CD CD 11 -----> 11 C goes from 1 to 1 (keep it) ---> 1 = C D goes from 1 to 1 (keep it) ---> 1 = D Final expression for magenta bit - A'CD Final Final expression - E = BC' + A'B + A'CD Hope that helps!
It's easier if you write out the letters of each group, I do them on top of each other. Now eliminate the values that differ (ie. a group of four having A and A-Not varying throughout but BCD consistent then becomes just BCD). If you have more than one group, you continue on in the equation by +'ing it (BCD + AD + etc..). Once you're good enough you can map more quickly using 1's and 0's. I still just write it out
Each bit listed is one bit apart in all directions. Even wrapping around from one end to the other. So 00, 01, 11, 10 | 00, 01, 11, 10 | ... Note that you aren't counting. You are just making sure that each category is different by only 1 bit. So even though 01 is 1 and 11 is 3, they only differ by 1 bit. If you so 01 then 10 (2), they would differ by 2 bits (both bits need to swap states).
WOW!! in 6 minutes I understood more than in 6 hours with a university professor, congratulations
you have a shitty professor
@@edwardwhite8253
no, he was sleeping
nobody:
absolutely nobody:
comment section on every math tutorial : "WOW!! in x minutes I understood more than in x hours with a university professor,
I get this stuff in college....
Same, i dint understood it in 4 hr of courses, i had it explained to me in a damn hard and complicated way, but this video saved me.
I finally get after going through all indian tutorials and listening my recorded teacher's explanation. This is just a simple explanation.
🚳
this is the best explanation ive heard between tutor and multiple professors. thanks
thanks sir
you explained better than my teacher.
i needed this
much thanks
The only clear explanation on UA-cam about KMaps. Thanks!
Thank you sir. You saved my class from bad test results!
Thank you for posting this. I learned how to simplify Boolean expressions using Kavanaugh maps several years ago and had since forgotten how to do it.
Hey man i have an exam tomorrow, your example really helped me, thank you so much. Better than my teacher tbh i got the concept in 6 mins.
we have in 3 hrs
Same here!!!
A full lesson within a 6 min.....just understood well!!! Thank you so much ......i have watched my teacher's recording too but I was unable to understand 💖
Dude you just explained in 5 minutes what some nerd teacher would explain in a hour, good job and Thank You
Thanks man. Its at least my 8th time forgeting and relearning them. This was a real quick memory refresh :)
very straightforward, reviewing this before my digital systems exam. thank you!
I have an exam tomorrow morning and this definitely helped! Lecturer taught this weird
YOU'RE A LIFE SAVER! I have an exam tomorrow and your video helped a lot! thank you Sir!
how did your exam go?
I really struggle with the grouping bit. I don’t get how you figure out the expression after grouping
That's what I have trouble with. Basically you need to see which bits cancel out. For instance, if a grouping has one bit that is A'B and another bit that is AB, then the A cancels out leaving just B.
Another way to look at it is if there is an odd number of one type of state and an even number of its complement, then that state is part of the final term. If there is an even number of a state and its complement, then that state gets cancelled out.
If the state changes then ignore it but if not count it. Look at the sets of two numbers together to the right of AB and below CD (i.e. 00, 01, 11, 10).
For example -
Red bit (AB and CD are changing states):
AB AB
01 -----> 11
A goes from 0 to 1 (ignore it)
B goes from 1 to 1 (keep it) ---> 1 = B
CD CD
00 -----> 01
C goes from 0 to 0 (keep it) ---> 0 = C'
D goes from 0 to 1 (ignore it)
Final expression for red bit - BC'
________________________________________
Green bit (Only CD are changing states):
AB AB
01 -----> 01
A goes from 0 to 0 (keep it) ---> 0 = A'
B goes from 1 to 1 (keep it) ---> 1 = B
CD CD
CD CD
00 -----> 01
-----> 11 -----> 10
C goes from 0 to 0 to 1 to 1 (ignore it)
D goes from 0 to 1 to 1 to 0 (ignore it)
Final expression for green bit - A'B
________________________________________
Magenta bit (Only B is changing states):
AB AB
00 -----> 01
A goes from 0 to 0 (keep it) ---> 0 = A'
B goes from 0 to 1 (ignore it)
CD CD
11 -----> 11
C goes from 1 to 1 (keep it) ---> 1 = C
D goes from 1 to 1 (keep it) ---> 1 = D
Final expression for magenta bit - A'CD
Final Final expression - E = BC' + A'B + A'CD
Hope that helps!
Phil Guitar Thank you!
@@philguitar3058 thank u sm this was very helpful!!
@@Undertakerfan700 You're very welcome!
how is a table of truth not needed for this kind of question? i'm really confused even i can solve it
Isn’t it gonna be redundant if we use it that way?
based on De morgans (AB)'=A'+B' .Why did you split it like A'*B' ?
I still dont get how to get the final formula
It's easier if you write out the letters of each group, I do them on top of each other. Now eliminate the values that differ (ie. a group of four having A and A-Not varying throughout but BCD consistent then becomes just BCD). If you have more than one group, you continue on in the equation by +'ing it (BCD + AD + etc..). Once you're good enough you can map more quickly using 1's and 0's. I still just write it out
@@brianfincher8354 ur comment makes it more clear to me 🙂
Thank you,I learned very quickly with your help!
An amaizing video! Thank you so much!
MatthewMatosis here teaching boolean algebra like a boss
Why complements are 0 and variables are 1/true?
I understood more in this 6 minute video than in my 2 hour class 😮
(I fell asleep, that might have done something to do with it hehe)
Short and sweet!!
Thank you very much for your help 🤩!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
Logic gate..... Circuit diagram slow ka video h??????
the best of all time
Thank you so much... your explaination really great..
what is the logic behind numbering of the Karnaugh maps
Each bit listed is one bit apart in all directions. Even wrapping around from one end to the other.
So 00, 01, 11, 10 | 00, 01, 11, 10 | ...
Note that you aren't counting. You are just making sure that each category is different by only 1 bit.
So even though 01 is 1 and 11 is 3, they only differ by 1 bit. If you so 01 then 10 (2), they would differ by 2 bits (both bits need to swap states).
This is called Gray Code, and it makes sure that each combination in the sequence differs by only one bit.
perfect explanation!!
Sir what is non prime implicant in kmap
cool so Karnaugh maps simplify logic statements
fire shit bro💪🏾💯
Very good, thank you
Great explanation. Thanks
amazing keep going
Running the video at 1.5x speed helps alot.
Thank you!
How to find which grp is to take first
Does not matter
Well explained :D
THANK YOU FOR THIS
Thank you, very helpful. :)
Thank you. Very helpful
You Are Great..
Thank you daddy
thank sir from india
Thankyou so much..🙏🙏..
thank you sir.
Mind blown
thank you
Thanks for nine tutorial
thanks so much!!!
i cannot understand
thanks a lot
A'CD + A'B + C'B
u r English is good for today but not sufficient for tommorow
Said by an Indian ha ha
lol bruh...
Thank u sir
Thanks man
make video on one hot encoding
i love you ❤
if you still do a wrong k-map, lets troubleshoot your maths by watching:
ua-cam.com/video/5_dxk2FqEnY/v-deo.html&t
oti naneeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeee
I watched this in 2024 and thanksss alotttt u made it clear for me 🤍
give me my 6 minutes back
Thank you!
thank you
Thank you!