Learn logic gates and Boolean algebra the easy way: binary digits, Boolean addition and multiplication, inverses, De Morgan's laws, and the AND, OR, NOT, NOR and NAND gates.
Key Takeaways
- Logic gates are built from diodes and transistors and use Boolean algebra to allow or block digital signals.
- Boolean algebra follows ordinary arithmetic except that 1 + 1 = 1.
- De Morgan's theorems allow complex gate expressions to be simplified.
- NAND and NOR are universal gates that can be combined to build any other logic gate.
What the video covers
- Introduces binary digits (0 and 1) as the basis of Boolean algebra and digital computing.
- Explains Boolean addition and multiplication rules, noting that 1 plus 1 equals 1 in Boolean algebra.
- Covers basic identities such as A + A' = 1, A · A' = 0, and double inversion (A'' = A).
- Presents De Morgan's theorems with a proof and a memory trick for remembering them.
- Defines logic gates as digital devices that perform Boolean functions on inputs to produce an output.
- Describes the OR gate, its Boolean expression Y = A + B, and its truth table.
- Describes the NOT gate, which inverts its input.
- Explains the NOR gate as an OR gate followed by a NOT gate, with its truth table.
- Explains the NAND gate as an AND gate followed by a NOT gate, with its truth table.
- Works through a worked example simplifying a circuit of NAND and NOR gates to show it is equivalent to a single OR gate.
Full Transcript — Download SRT & Markdown
Speaker A
logic gates and Boolean Algebra I will teach you the super easy way to learn logic gates and exam questions also you will learn the basic concepts of Boolean algebra so watch this lecture till the end and you will learn something awesome firstly let me teach you binary digits well the word by means to we use only two digits 0 and 1 and a binary system the digit 0 represents low value of our files while the digit one represents high value on R true this is the
Speaker A
complete philosophy of binary digits 0 and 1. I hope you know that every computer use the binary digits 0 and 1. now I will teach you the basic concept of Boolean algebra only in one statement I mean in Boolean algebra we use binary digits and 1 plus 1 is equal to 1 because there is no other digit let me repeat it in Boolean algebra we use binary digits and 1 plus 1 is equal to 1 because there is no other digit hence if you learn this basic concept you can
Speaker A
easily learn Boolean algebra for example consider addition of binary digits in Boolean algebra we know that 0 plus 0 is equal to 0 0 plus 1 is equal to 1 1 plus 0 is equal to 1 1 plus 1 is equal to 2 but in Boolean algebra there is no such digit like 2 so 1 plus 1 is equal to 1. secondly consider multiplication of binary digits in Boolean algebra remember that 0 and multiplication is a hydrogen bomb and it finishes everything let me repeat it 0 and multiplication is
Speaker A
a hydrogen bomb and it finishes everything like 0 into 0 is equal to 0 0 and 1 is equal to 0 1 into 0 is equal to 0 and 1 and 1 is equal to 1. just remember that in Boolean algebra all the mathematical operation are the same except 1 plus 1 is equal to 1. now if you want to learn logic gates you must learn Boolean algebra without it you cannot learn a single concept of logic gates hence I will teach you some basic concepts of Boolean algebra firstly let me teach you addition of binary digits
Speaker A
let a is equal to 0 our a is equal to 1. now A plus 1 is equal to 1 we know that a is equal to 0 our a is equal to 1 so 0 Plus 1 is equal to 1 r 1 plus 1 is equal to 1. secondly a plus 0 is equal to a we know that a is equal to 0 our a is equal to 1 so 0 plus 0 is equal to 0 r 1 plus 0 is equal to 1 also let me teach you the multiplication of binary digits let a equal 0 are a equals one now a into 1 is equal to 1. we know that a is equal to 0 or a equals 1 so 0 into 1 is equal
Speaker A
to 0 r 1 into 1 is equal to 1. secondly a into 0 is equal to zero we know that a equals 0 are a equals one so 0 into 0 equals 0 or 1 into 0 equals zero hence addition and multiplication of binary digits are very simple now let me teach you the concept of inverse in Boolean algebra for example consider low value if I ask you what is its opposite value your answer is simple its opposite is high value we know that 0 represents low value and 1 represents high value so the
Speaker A
inverse of 0 is 1 and that of 1 is 0. for example if one binary digit is a its inverse is a bar just remember that bar on any variable represents inverse value now A plus a bar is equal to 1 let a equals 0 can you guess the value of a inverse well a bar represents the opposite value of a a equals 0 a bar equals 1 because the opposite value of 0 is 1 and vice versa Now 1 plus 0 is equal to 1 hence we say that a plus a bar equals 1 fourthly a double bar equals a for example let a equals 1 I
Speaker A
inverse the value of a I get a inverse equals zero I again inverse the value of a I get a double bar equals one hence the initial value of a is equal to 1 and that of a double bar is also equal to 1. thus we say that a double bar is equal to a the simple trick is always cancel the 2 bars fifthly a DOT a bar equals 0 let a equals 1 and a bar becomes 0 now 1 into 0 is equal to zero thus a into a bar equals zero thus noted down all these basic concepts of Boolean algebra
Speaker A
now I will teach you one Advanced concept of Boolean algebra a plus b whole bar equals a bar plus b bar let me also teach you its proof firstly consider left hand side at the left hand side we have a plus b whole bar now consider values of A and B let a equals 1 and P equals 0 because here we can use only these two digits I will solve this question in two steps in the first step I will find a plus b on the second step I will find inverse of a plus b now in the first step a plus b is the value of
Speaker A
a is 1 and that of B is 0 1 plus 0 I get 1 hence the value of a plus b is equal to 1 and the second step we have to inverse the value of a plus b we know that a plus b is equal to 1 and its inverse is zero thus it will left hand side A plus b whole inverse is equal to zero that this is equation number one now at the right hand side we have a bar dot b bar we know that a equals 1 and b equals zero now the value of inverse a is equal to 0 and the value of inverse B
Speaker A
bar is equal to 1. according to the given statement we have to multiply a inverse and B inverse I write 0.1 I get 0 that's the value of a bar dot b bar equals 0 let this is equation number two we can see that equation number one a plus b whole bar equals 0 and equation number two a bar dot b bar is also equal to zero hence equation number one is equal to equation number two and left hand side is equal to right hand side therefore 4 we say that a plus b whole bar equals a bar dot b bar
Speaker A
similarly a dot b whole bar is equal to a bar plus b bar now I will teach you my personal and super easy trick to remember these two equations let I write a plus b whole bar and a dot b whole bar I always write a bar B Bar a bar B Bar secondly if there is plus I convert it to Dot if there is dot I convert it to plus this is the super fast easy trick to remember these two equations now it is time to teach you the easy concepts of logic gates firstly let's understand
Speaker A
the basic purpose of a gate consider this open door and this closed door in case of Open Door you are allowed to pass through in case of closed door you are not allowed to pass through similarly consider these logic gates logic gates either do not allow electrical signal to pass through a logic gates allow electrical signal to pass through I mean we use logic gates in order to allow or block electrical signals our digital signals to enter into the circuit just remember that we use logic gates to
Speaker A
on and off any digital circuit now what are logic gates well consider this logic gate we give two inputs to any logic gate and we get only one output for example I gave 1 and 1 SN ports to this logic gate we know that one represent on this logic gate will give us one as output so it allowed the digital signal to pass through secondly consider this logic gate I give two inputs to 8 0 and 0. we know that 0 represents of this logic gate will give us 0 as output so it does
Speaker A
not allow digital signal to pass through thus we give two Imports to a logic gate it performs a Boolean function and gave us an output therefore we Define logic gates as the digital devices which perform Boolean function by taking two end ports and giving an output let me repeat it the digital devices which performs Boolean function by taking two end ports and giving an output remember that logic gates work on the principles of Boolean algebra secondly logic gives
Speaker A
are made up of diodes and transistors thus remember that with the help of Boolean algebra logic gates either allow or block signals in order to enter into the circuit now what are the types of basic logic gates well there are five Universal logic gates firstly we will learn three logic gates like or and not in case of or gate I halfly cut the O I draw it here and I curve this side we always give two inputs to the logic gate Like A and B use these Imports to give
Speaker A
us an output y now the question is how this or gate process these two end ports a b well or get add these two n ports A and B so I write output Y is equal to a plus b now consider this truth table we know that the possible value of a b is either 0 0 0 1 1 0 or 1 1 what about the value of y well or get always sum up the value 0 plus 0 is equal to 0 0 plus 1 is equal to 1 1 plus 0 is equal to 1 1 plus 1 is equal to 2 but in Boolean algebra there is no such digit like 2 so 1 plus
Speaker A
1 is equal to one thus this is the truth table of or gate secondly in case of and gate I take this T I write it here I give two inputs A and B it give us an output y now how this and gate process these two n-boards A and B well in case of and gate this T reminds me dot I mean Y is equal to a DOT P so and gate multiply A and B to give us an output y now consider this truth table along with the possible values of A and B what about the value of y well and gets multiply A and B are
Speaker A
and gate multiply n Parts 0 and 0 is equal to 0 0 into 1 equals 0 1 into 0 equals 0 1 and 1 equals one thus this is the truth table of and gate thirdly in case of not gate I halfly cut the end and I write it here like this also I select this o and I write it here I give one input add to not get remember that not gate inverse the value of n Port so its output is a bar our y equals a bar for example consider this truth table the possible values of a is 1 and 0. what about the value of y well just
Speaker A
inverse the value of a the inverse of 1 is 0 and that of 0 is 1 hence this is the truth table of not gate now the fourth gate is nor gate we take not gate and or gate to form nor gate here I draw or gate and I just put only small circle in front of it this is the nor gate now listen carefully the or gate will add the inputs a plus b and the nor gate will inverse it let me repeat it the or gate will add the end ports A and B and the not gate will inverse it so I write
Speaker A
or gate Y is equal to a plus b then I put bar on 8 because not get inverse 8. what about its truth table well consider these possible values of A and B now or gate will add them 0 plus 0 is equal to 0 0 plus 1 is equal to 1 1 plus 0 is equal to 1 1 plus 1 is equal to 1. also we know that the not gate will inverse them inverse of 0 is 1 and that of 1 is 0 I write zero zero zero thus this is the truth table of nor gate the last and the fifth gate is nand gate we take not
Speaker A
gate and and gate to form nand gate here I throw and gate and I put only small circle in front of it this is the nand gate now listen carefully the and gate will multiply the inputs A and B and the not gate will inverse it let me repeat it the and gate will multiply the inputs a b and the not gate will inverse it I write and gate y equals a dot b then I put Power on 8 because not gate will inverse 8. what about its strip table well consider these possible values of a
Speaker A
b now and gate will multiply them 0 into 0 equals 0 0 into 1 equals 0 1 and 2 0 equals 0 1 into 1 equals one while the not gate will inverse them we know that inverse of 0 is 1 and vice versa I write 1 1 1 and 0 hence this is the truth table of nand gate therefore using this simple way we can easily learn all logic gates now let me teach you that how to write function for any logic gate well consider these two systems firstly I always spot the type of logic gate for
Speaker A
example in the first system this is and gate this is or gate now two inputs a b are given to and gate we know that and gate will multiply the end ports so we get a dot b as in output secondly a dot b and this C is given as n port to or gate we know that or gate at the end ports it adds a dot b plus C hence we get y equals a dot b plus C on the other hand this is nand gate this is nor gate and this is or gate now two inputs a b are given to nand gate the and gate will
Speaker A
multiply 8 a dot b while the not gate will inverse it I put bar on a dot b secondly two inputs CD are given to nor gate the or gate will add 8 C plus T and the not gate will inverse 8 I put bar on C plus d thirdly this or gate receives two n-words a dot b whole bar and C plus d whole bar we know that or gate will add the end ports we get a dot b whole bar plus C plus T whole bar thus the function of this system is y equals add dot b whole bar plus C plus T whole bar
Speaker A
therefore using this simple method we can easily write function for any logic gate system finally let me teach you some exam questions what will be the value of a and b for the Boolean Expression A plus b toolbar into a bar dot b bar equals one well the question is what value of a and b should we take so that left hand side becomes equal to the right hand side let I take a equals 0 and b equals 0. now consider left hand side A plus b whole bar N2 a bar dot b
Speaker A
bar I put the values of A and B and 8. I write 0 plus 0 into whole bar dot 0 bar dot 0 bar we know that 0 plus 0 is equal to 0 I write 0 bar and 2 also we know that 0 bar or inverse of 0 is 1 I write 1.1 now this 0 bar means that inverse of 0 which is 1 I write 1.1.1 we know that 1.1.1 is equal to 1. therefore if we take the values of A and B as 0 we get fun hence the value of a is 0 and the value of B is 0. secondly consider this digital circuit this logic gate is
Speaker A
equivalent to dash well firstly I spot the logic ads this is not gate this is also not gate and this is nand gate now this not gate will inverse the input a and we get a bar here we also get B Bar secondly this nand gate receives two n-words a bar and B Bar the and gate will multiply 8 we get a bar dot b bar while the not gate will inverse it we get a bar dot b bar into whole bar also we know that a bar dot b bar equals a plus b whole bar so instead of this a
Speaker A
bar dot b bar I write a plus b whole bar I get a plus b double bar also we know that in case of double bars we cancel it we get a plus b we know that a plus b represents or gate hence this digital circuit is equivalent to or gate thus using this simple method we can solve logic gate problems easily I hope that you have learned all about logic gates
Topics:logic gatesBoolean algebrabinary digitsAND gateOR gateNOT gateNOR gateNAND gateDe Morgan's theoremdigital electronics











