The Laws of Boolean Algebra Explained

Подписаться 622 тыс.

Просмотров 97 тыс.

50% 1

In this video, the basic Boolean Algebra Laws like Commutative Law, Associative Law, Distributive Law, Absorption Laws, etc are explained in detail.
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
Boolean Algebra Laws:
AND Laws:
A.0 = 0
A.1 = A
A.A' = 0
A.A = A
OR Laws
A + 0 = A
A + 1 = 1
A + A = A
A + A' = 1
Comutative Law
A. B = B.A
A + B = B + A
Associative Law:
(A.B).C = A. (B.C)
(A + B) + C = A + (B + C)
Distributive Law :
A. (B + C) = AB + AC
A + BC = ( A + B) (A + C )
Absorption Law:
A + AB = A
A . (A + B) = A
Double Negation Law:
(A')' = A
Digital Electronics (Playlist):
• Digital Electronics
This video will be helpful to all the students of science and engineering in understanding the basic laws of Boolean Algebra.
#ALLABOUTELECTRONICS
#BooleanLaws
#BooleanAlgebra
Support the channel through membership program:
/ @allaboutelectronics
--------------------------------------------------------------------------------------------------
Follow my second channel:
/ @allaboutelectronics-quiz
Follow me on Facebook:
/ allaboutelecronics
Follow me on Instagram:
/ all_about.electronics
--------------------------------------------------------------------------------------------------
Music Credit: www.bensound.com

Наука

Опубликовано:

27 июн 2024

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист

Посмотреть позже

Комментарии : 29

@ALLABOUTELECTRONICS 2 года назад

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

@sayemislam6046 Год назад

thanks for explaining amazingly

@umarmuzammil7332 6 месяцев назад

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

@user-qe9yq4ee1s 2 месяца назад

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

@jeraldshau6187 Месяц назад

Wow just wow thank u for this great video

@pk4025 2 года назад

Please make video on switching circuit of all logic gates

@javeriaaiman5480 8 месяцев назад

Good explanation, quite helpful keep going 💓✨

@mayurshah9131 2 года назад

Excellent 👍👍

@hattron6704 2 года назад

Thank you!

@sanjayshah9838 2 года назад

Excellent 👌👌👍

@ishanmoykhede6085 2 года назад

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

@matidzek1227 8 месяцев назад

Great!

@Divinewisdomforhustlemind 11 месяцев назад

Thanks ❤️

@astikpatil5773 2 года назад

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

@sanjayshah9838 2 года назад

👌👌👌

@thegamerdaddycool3384 2 года назад

best

@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 4 месяца назад

@@ALLABOUTELECTRONICS ❤️

@adithya.p3067 2 месяца назад

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 2 месяца назад

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

@suicidegamers8956 6 месяцев назад

Legends watch this video one day before exam 😅😂

@_thunderbird 4 месяца назад

I’m watching day of 😭

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

@mythic7521 2 года назад

First

@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 ???