16/7/2020 Denny Chellappa

19BEC1360

Experiment No. 1
Design and Implementation of Basic
Logic Gates and Combinational Circuits
Aim:
1. To verify the basic logic gates (AND, OR, NOT, NAND, NOR AND XOR) using truth
table
2. To verify the given Boolean functions
Y = A'B + AB' + AB
Y = ABC + A’CB + (B+C) (A+C) + (A+B) C
3. To verify De-Morgan’s theorem
(AB)’ = A’ + B’
(A+B)’ = A’ B’
4. To verify the given Boolean functions using De-Morgan’s theorem
Y = (AB+AC)’ + A’B’C
Y = A’B’C + AB’C’ + ABC
5. To implement Sum of Product (SOP) and Product of Sum (POS) for given Boolean
functions
Y = A’BC’ + AB’C’ + AB’C + ABC’ (SOP)
Y = (A+B+C) (A+B+C’) (A+B’+C’) (A’+B’+C’) (POS)

Software Used:
Logic Gate Simulator.
Procedure:
• Construct the truth table.
• Setup the circuits in the simulator to analyze the operations of basic logic gates, verify the
Boolean functions, verify the De-Morgan’s theorem and implement the SOP and POS
• Vary the inputs and measure the outputs.
• Do this for all possible combinations of inputs.

Task 1
To verify the basic logic gates (AND, OR, NOT, NAND, NOR AND XOR) using truth table

Simulation:
AND (IC 7408) Logic Gate
Truth Table
A B Y
0 0 0
0 1 0
1 0 0
1 1 1
OR (IC 7432) Logic Gate
Truth Table
A B Y
0 0 0
0 1 1
1 0 1
1 1 1
NOT (IC 7404) Logic Gate
Truth Table
A Y=A’
0 1
1 0

NAND (IC 7400) Logic Gate

Truth Table
A B Y= (A.B)’
0 0 1
0 1 1
1 0 1
1 1 0
NOR (IC 7402) Logic Gate
Truth Table
Y=(A+B)
A B
’
0 0 1
0 1 0
1 0 0
1 1 0
XOR (IC 7486) Logic Gate
Truth Table
A B Y
0 0 0
0 1 1
1 0 1
1 1 0
Result
Hence, the truth tables for AND, OR, NOT, NAND, NOR and XOR logic gates are verified.
 Task 2
To verify the given Boolean functions
Y = A'B + AB' + AB
Y = ABC + A’CB + (B+C)(A+C) + (A+B)C
Components Used:
S.No Componen Specificatio Quantit
. t n y
1. OR IC 7432 2
2. AND IC 7408 3
3. NOT IC 7404 2

Simulation:
Circuit 1
Truth Table
Y=A’B+AB’+A
A B A’ B’ A’B AB’ AB
B
0 0 1 1 0 0 0 0
0 1 1 0 1 0 0 1
1 0 0 1 0 1 0 1
1 1 0 0 0 0 1 1
Circuit 2
Truth Table
A+ A+ A’C (B+C)(A+ (A+B)
A B C A’ B+C ABC Y
B C B C) C
0 0 0 1 0 0 0 0 0 0 0 0
0 0 1 1 0 1 1 0 0 1 0 1
0 1 0 1 1 1 0 0 0 0 0 0
0 1 1 1 1 1 1 0 1 1 1 1
1 0 0 0 1 0 1 0 0 0 0 0
1 0 1 0 1 1 1 0 0 1 1 1
1 1 0 0 1 1 1 0 0 1 0 1
1 1 1 0 1 1 1 1 0 1 1 1
Result:
Hence, the given Boolean functions \
Y = A'B + AB' + AB
Y = ABC + A’CB + (B+C)(A+C) + (A+B)C are verified.
 Task 3
To verify De-Morgan’s theorem
(AB)’ = A’ + B’
(A+B)’ = A’.B’
Components Used:
S.No Componen Specificatio Quantit
. t n y
1. OR IC 7432 2
2. AND IC 7408 2
3. NOT IC 7404 6

Simulation:
Circuit 1: To Verify (AB)’=A’+B’
Truth Table
A B A’ B’ (A.B)’ A’+B’
0 0 1 1 1 1
0 1 1 0 1 1
1 0 0 1 1 1
1 1 0 0 0 0
Circuit 2: To Verify (A+B)’=A’.B’
Truth Table
A B A’ B’ (A+B)’ A’.B’
0 0 1 1 1 1
0 1 1 0 0 0
1 0 0 1 0 0
1 1 0 0 0 0

Result:
Hence, the De-Morgan’s theorem is verified.
 Task 4
To verify the given Boolean functions using De-Morgan’s theorem
Y = (AB+AC)’ + A’B’C
Y = A’B’C + AB’C’ + ABC
Show the simplified Boolean functions using De-Morgan’s theorem
Components Used:
Logic Gate Simulator.

A B C A B’ A AC (AB+AC) (AB+AC)’ A’B’C Y=(AB+AC)’ +

’ B A’B’C
0 0 0 1 1 0 0 0 1 0 1
0 0 1 1 1 0 0 0 1 1 1
0 1 0 1 0 0 0 0 1 0 1
0 1 1 1 0 0 0 0 1 0 1
1 0 0 0 1 0 0 0 1 0 1
1 0 1 0 1 0 1 1 0 0 0
1 1 0 0 0 1 0 1 0 0 0
1 1 1 0 0 1 1 1 0 0 0
Circuit 1: Y = A’ + B’C’

Truth Table

A B C A’ B’ C’ B’C’ Y=A’+B’C’
0 0 0 1 1 1 1 1
0 0 1 1 1 0 0 1
0 1 0 1 0 1 0 1
0 1 1 1 0 0 0 1
1 0 0 0 1 1 1 1
1 0 1 0 1 0 0 0
1 1 0 0 0 1 0 0
1 1 1 0 0 0 0 0
Y = A’B’C + AB’C’ + ABC
Truth Table:
A B C A’ B’ C’ AB’ AB’C’ A’B’C ABC Y = A’B’C + AB’C’ + ABC

0 0 0 1 1 1 0 0 0 0 0
0 0 1 1 1 0 0 0 1 0 1
0 1 0 1 0 1 0 0 0 0 0
0 1 1 1 0 0 0 0 0 0 0
1 0 0 0 1 1 1 1 0 0 1
1 0 1 0 1 0 1 0 0 0 0
1 1 0 0 0 1 0 0 0 0 0
1 1 1 0 0 0 0 0 0 1 1
Circuit 2:
Y = B’(A⊕C) + ABC
A B C B’ A ⊕C B’(A⊕C) ABC Y = B’(A⊕C) + ABC

0 0 0 1 0 0 0 0
0 0 1 1 1 1 0 1
0 1 0 0 0 0 0 0
0 1 1 0 1 0 0 0
1 0 0 1 1 1 0 1
1 0 1 1 0 0 0 0
1 1 0 0 1 0 0 0
1 1 1 0 0 0 1 1

RESULT:
Hence verified the given Boolean functions using De-Morgan’s theorem.