The Laws of Boolean Algebra Explained

[@ALLABOUTELECTRONICS]

Timestamps: 0:00 Introduction 1:26 AND Laws 5:01 OR Laws 8:51 Commutative Laws 9:27 Associative Laws 14:02 Distributive and Absorption Laws

[@j0v0]

I know this is old, but thanks. Your graphics are the best I've seen for logic gate explanations. The font is very clean and the color choices really help to keep everything from blending together.

[@ntshiila]

Nailed🎉...I was blind..now I can see clearly😊

[@umarmuzammil7332]

This video really helped.....thanks for your effort

[@ahmadjaradat3011]

thanks for explaining amazingly

[@DevuS-c5y]

Bro this is just soooo gooodd !! Excellent explanation!!👍 Keep it up !

[@pk4025]

Please make video on switching circuit of all logic gates

[@javeriaaiman5480]

Good explanation, quite helpful keep going 💓✨

[@jeraldshau6187]

Wow just wow thank u for this great video

[@mayurshah9131]

Excellent 👍👍

[@MaïmounaRéginaDiop]

so well explained!! thanks

[@ishanmoykhede6085]

Sir plzzz make a series on instrument used kn electronics plzzz 🙏🙏🙏

[@astikpatil5773]

Sir is their all chapter you have taken on this channel of class 12th electronics?

[@sanjayshah9838]

Excellent 👌👌👍

[@matidzek1227]

Great!

[@adithya.p3067]

What are the main logic gates how many are they draw the symbols answer please.... Basic logic gate is and or not when the question is main logic gate what is the answer

[@ALLABOUTELECTRONICS]

I think here main logic gate refers to AND, OR and NOT. NAND and NOR are universal gates.

[@hattron6704]

Thank you!

[@Divinewisdomforhustlemind]

Thanks ❤️

[@sambal-]

how can i create logic circuit if i have boolean expression?

[@ALLABOUTELECTRONICS]

First try to simplify the Boolean equation using the Boolean Algebra. Then depending on the Boolean equation, you can use the logic gate. For example, whenever there is an AND operation in the expression, you can use the AND gate. Whenever there is an OR operation, you can use OR gate. If the expression is something like (A.B.C )' then you can use 3-input NAND gate. And in this way, you can implement the logic circuit for the any given Boolean expression.

[@phatzmokuz177]

@@ALLABOUTELECTRONICS ❤️

[@parshotamrathod6135]

Sir, is there any exact method available to solve boolean algebra? 'cause I usually get very confused when the lengthy sum is asked in the paper...🤔🤔🤔

[@ALLABOUTELECTRONICS]

There is no exact method. You need to use the Boolean algebra laws only. But if you know K-map, then you can easily find the simplified expression. If the Boolean function contains upto 4 variables then Karnaugh map method is good way to get minimised expression. It is covered on the channel. Please check the digital electronics playlist on the playlist page of the channel. You will find it.

[@thegamerdaddycool3384]

best

[@sanjayshah9838]

👌👌👌

[@krishk4870]

Why A+A' = 1 it's not right because if passing A= 0 and A' = 1 == 0 ri8 then o/p will be 0 then why 1 ?

[@ALLABOUTELECTRONICS]

If A = 0 then A' = 1. That means A + A' = 0 + 1 = 0. For OR operation, if any one of the input is 1 then output is 1. I hope it will clear your doubt.

[@krishk4870]

@@ALLABOUTELECTRONICS cleared. I thought like we will assign 0's and 1 individually for A and A' I just lost that concept if A = 1 means A' going to be zero only so A+A' = 1. By the way amazing explanation man thankyou much appreciated... But I couldn't get the differences between laws(commutative, associative, distributive) it seems for me, All are derivated in similiar ways only. How can I ack the differences in problems like it should be solve in this law that law, like that. How should I practice it ???

[@mythic7521]

First

[@Gamergenix75]

Sir gates diagram not clear 😢😢

[@ALLABOUTELECTRONICS]

Would you please mention the timestamp where you are finding it difficult !!

[@sayemislam6046]

thanks for explaining amazingly