Experiment No.

1
Aim: To study and verify the Truth Tables of AND, OR, NOT, NAND, NOR, EXOR logic gates

Theory:

AND, OR and NOT gates are basic gates. XOR and XNOR are universal gates.
Basically logic gates are electronic circuits because they are made up of number of electronic
devices and components. Inputs and outputs of logic gates can occur only in two levels. Thesetwo
levels are term HIGH and LOW, or TRUE and FALSE, or ON AND off, OR SIMPLY 1 AND 0. A
table which lists all possible combinations of input variables and the correspondingoutputs is called
a „truth table‟. It shows how the logic circuit‟s output responds to various combinations of logic
levels at the inputs.

AND GATE:-

An AND gate has two or more inputs but only one output. The output assumes the logic 1
state only when each one of its inputs is at logic 1 state. The output assumes logic 0 state even if
one of its input is at logic 0 state. AND gate is also called an „all or nothing‟ gate.

The logic symbol & truth table of two input AND gate are shown in figure 1.a & 1.brespectively.
The symbol for AND operation is „.‟.

With input variables A & B the Boolean expression for output can be written as;

X = A.B

Logic symbol: Truth table:

Input Output

A 1
A B X
2
3 X
B 0 0 0
X = AB
0 1 0

1 0 0

1 1 1

Fig.1.a Fig.1.b
OR GATE

Like an AND gate, an OR gate may have two or more inputs but only one output. The output
assumes the logic 1 state, even if one of its inputs is in logic 1 state. Its output assumes logic 0 state,
only when each one of its inputs is in logic 0 state. OR gate is also called an „any orall‟ gate. It can
also be called an inclusive OR gate because it includes the condition „both the input can be
present‟.

The logic symbol & truth table of two input OR gate are shown in figure 1.c & 1.d
respectively. The symbol for OR operation is „+‟.

With input variables A & B the Boolean expression for output can be written as;

X=A+B

Logic symbol: Truth table:

Input Output
A 1
3
2
X A B X
B
X= A+ B 0 0 0

0 1 1

1 0 1

1 1 1

Fig.1.c Fig.1.d

NOT GATE

A NOT gate is also known an inverter, has only one input and only one output. It is a device
whose output is always the complement of its input. That is the output of a not gate assumes the
logic 1 state when its input is in logic 0 state and assumes the logic 0 state when itsinput is in logic 1
state.

The logic symbol & truth table of NOT gate are shown in figure 1.e & 1.f respectively.
The symbol for NOT operation is „-„-‟(bar).

With input variable A the Boolean expression for output can be written as;

̅
X=A
This is read as “X is equal to a bar”.

Logic symbol: Truth table:

Input Output

A X

0 1

1 0

Fig.1.e Fig.1.
NAND GATE

NAND gate is universal gate. It can perform all the basic logic function. NAND means
NOT AND that is, AND output is NOTed.so NAND gate is combination of an AND gate and a
NOT gate. The output is logic 0 level, only when each of its inputs assumes a logic 1 level. For
any other combination of inputs, the output is logic 1 level. NAND gate is equivalent to a bubbled
OR gate.

The logic symbol & truth table of two input NAND gate are shown in figure 1.g & 1.hrespectively.

With input variables A & B the Boolean expression for

output can be written as;

X = ̅A̅. ̅B̅

Logic symbol: Truth table:

Input Output

A 1 A B X
2
3 X
B 0 0 1

X = AB 0 1 1

1 0 1

1 1 0

Fig.1.g Fig.1.h
NOR GATE

NOR gate is universal gate. It can perform all the basic logic function. NOR means NOT OR
that is, OR output is NOTed.so NOR gate is combination of an OR gate and a NOT gate. Theoutput
is logic 1 level, only when each of its inputs assumes a logic 0 level. For any other combination of
inputs, the output is logic 0 level. NOR gate is equivalent to a bubbled AND gate. The logic
symbol & truth table of two inputs NOR gate are shown in figure 1.i& 1.j respectively. With input
variables A & B the Boolean expression for output can be written as;

X = ̅𝐴̅+̅𝐵̅

Logic symbol: Truth table:

Input Output

A B X
A 2
1
X 0 0 1
B 3

0 1 0
X= A+ B
1 0 0

1 1 0

Fig.1.i Fig.1
EXCLUSIVE-OR (X-OR) GATE

An X-OR gate is a two input, one output logic circuit, whose output assumes a logic 1 state
when one and only one of its two inputs assumes a logic 1 state. Under the condition when both the
inputs are same either 0 or 1, the output assumes a logic 0 state. Since an X-OR gate produces an
output 1 only when the inputs are not equal, it is called as an anti-coincidence gate or inequality
detector. The output of an X-OR gate is the modulo sum of its two inputs. The logicsymbol & truth
table of two input X-OR gate are shown in figure 1.k & 1.l respectively. The symbol for X-OR
operation is „⊕‟. With input variables A & B the Boolean expression for output can be written as;

X= A ⊕ B

Logic symbol: Truth table:

Input Output

A B X
1
A 3
2
X
B 0 0 0

0 1 1
X= A ⊕ B
1 0 1

1 1 0

Fig.1.k Fig.1.l
Procedure:-

• Used online virtual lab Simulator

• Test all the truth tables of all gates.
• Give various combinations of inputs and check the output.