Draw the diagram for AND, OR, and NOT gates using discrete
components. Explain the woking with truth table
AND Gate (Multiplication ):
An AND gate has two (or) more input signals but only one output signal. It is
called an AND gate because the output voltage is high, when all inputs are
high. The symbolic representation of two input AND gate is shown in figure
1) When the both inputs( A and B) are zero, i.e., A = 0 and B= 0 then
A.B= 0.0 = 0
2) When A = 0 and B = 1 then A.B = 0.1 = 0
3) When A = 1 and B= 0 then A.B = 1.0 = 0
4) When A = 1 and B =1 then A.B = 1.1 =1
Truth table for AND gate
A B Y = A.B
0 0 0
0 1 0
1 0 0
1 1 1
OR Gate (Addition):
An OR gate has two (or) more input signals but only one output signal. It is
called an OR gate because the output voltage is high if any one of the input
is high.
The symbolic representation of OR Gate is show in figure
MANEESH | manimaneesh33@[Link]
1) When the both inputs are zero( A and B) i.e, A = 0 and B= 0 then
Y= A+B = 0 + 0 = 0
2) When A = 1 and B = 0 then Y = A+B = 1+0 = 1
3) When A = 0 and B = 1 then Y = A+B = 0 +1 = 1
4) When A =1 and B=1 then Y = A+B = 1+1 = 1
Truth table for OR gate
A B Y = A+B
0 0 0
0 1 1
1 0 1
1 1 1
NOT Gate :
The NOT gate is a gate with only one input and one output. When the input
is high the output is low. When the input is low, the output is high. The NOT
gate is also called an inverter
The symbolic representation of NOT gate as follows
Truth table
A Y=Â
0 1
1 0
MANEESH | manimaneesh33@[Link]
What are NAND, NOR and X-OR gates
NAND Gate :
The NAND gate is called a universal gate since any logic circuit can be built
by using NAND gates only. NAND gate can be obtained by connecting a NOT
gate in the output of AND gate
If A = 0 and B = 0 then Y = (0.0)’ = 0’ = 1
If A = 0 and B = 1 then Y = (0.1)’ = 0’ = 1
If A = 1 and B =0 then Y = (1.0)’ = 0’ = 1
If A =1 and B=1 then Y = (1.1)’ = 1’ = 0
Truth table for NAND gate
A B Y = (AB)’
0 0 1
0 1 1
1 0 1
1 1 0
NOR Gate
It is the combination of OR and NOT gates. When the output of OR gaate is
connected to NOT gate the combination is called a NOR gate.
MANEESH | manimaneesh33@[Link]
The circuit symbol is as shown in figure
If A = 0 and B = 0 then Y = (A+B)’ = (0+0)’ = 0’ = 1
If A = 0 and B = 1 then Y = (0+1)’ = 1’ = 0
If A = 1 and B = 0 then Y = (1+0)’ = 1’ = 0
If A = 1 and B =1 then Y = (1+1)’ = 1’ = 0
Truth table for NOR gate
A B Y = (A+B)’
0 0 1
0 1 0
1 0 0
1 1 0
X-OR Gate or Exclusive OR gate :
Digital electronics allows as to bulid circuits that can add and subtract. For
subtraction, the circuits used are called exclusive OR gate
The symbolic representation of X-OR gate is shown in figure
MANEESH | manimaneesh33@[Link]
The symbol ⨁ denotes the exclusive OR gate operation
If A = 0 and B = 0 then X = A⨁ B = A. + B’.B = 0.0’+0’.0 = 0.1 +1.0 = 0+0 = 0
If A = 0 and B= 1 then X = 0.1’+0’.1 = 0.0+1.0 = 0+1 = 1
If A =1 and B =0 then X = 1.0’+1’.0 = 1.1+0.0 = 1+0 = 1
If A =1 and B =1 then X = 1.1’+1’.1 = 1.0+0.1 = 0 + 0 = 0
Truth table for X-OR gate
A B X=A ⨁ B
0 0 0
0 1 1
1 0 1
1 1 0
MANEESH | manimaneesh33@[Link]
