PART-1: Verification of Logic Gates

1. Problem Statement: To study and verify the truth tables of

fundamental digital logic gates AND, OR, NOT and derived gates NAND,
NOR, XOR, XNOR.

2. Components Required:
 Logic Gates – AND, OR, NOT, NAND, NOR, XOR, XNOR
 Switches
 Red Probe
3. Theory
Logic gates are the fundamental building blocks of digital
electronic circuits. They perform logical operations on one or more
binary inputs (0 or 1) to produce a single binary output. Each logic gate
follows a specific Boolean expression and truth table.
The basic logic gates are AND, OR, and NOT, while NAND, NOR, XOR,
and XNOR are derived gates. These gates are used to implement
Boolean functions and form the basis of combinational and sequential
digital circuits.

4. Design
a. AND Gate
Circuit Diagram: Truth Table:

A B A.B
0 0 0
0 1 0
1 0 0
 1 1 1

b. OR Gate
Circuit Diagram: Truth Table:

A B A+B
0 0 0
0 1 1
1 0 1
1 1 1

c. NOT Gate
Circuit Diagram: Truth Table:

A A’
1 0
0 1
d)NAND Gate
Circuit Diagram:
Truth Table:

A B Y=~(A.B)
0 0 1
0 1 1
1 0 1
1 1 0

e)NOR Gate
Circuit Diagram:
Truth Table:

A B Y=(A+B)’
0 0 1
0 1 0
1 0 0
1 1 0

f)XOR Gate

Circuit Diagram:
Truth Table:

A B AB
0 0 0
0 1 1
1 0 1
1 1 0

g)XNOR Gate:
Circuit Diagram:
Truth Table:

A B A⊙ B
0 0 1
0 1 0
1 0 0
1 1 1
 5. Observation:

GATE Test Case-1 Test Case-2

AND When, both the inputs When, one of the input
are high the output is if low output is low
also high
OR When, one of the input When both the input
is high the output is also are low the output is
high also low
NOT When the input is high When the input is low,
output is low the output is high
NAND When one of the input When both the inputs
is low output is high are high output is low
NOR When both the inputs When, one of the input
are low output is high is high output is low
XOR When both the input When both the input
are same output is low are different output is
high
XNOR When both the input When both the input
are same output is high are different output is
low

6. Conclusion:
Digital circuits are an integral part of modern electronic systems and are used in a wide
range of real-world applications. Some of the important applications are:
1. Computers and Microprocessors - Logic gates are used to build processors, memory units,
and arithmetic circuits. They perform logical operations, data processing, and instruction
execution.
2. Traffic Light Control Systems - Digital circuits control the sequence and timing of traffic
signals. Logic gates ensure proper switching of lights based on predefined conditions.

3. Security and Alarm Systems - Logic gates process inputs from sensors such as motion,
smoke, and door sensors. The alarm is activated only when the required logical conditions
are satisfied.

4. Communication Systems - Digital circuits are used in mobile phones, routers, and
communication devices for data encoding, decoding, signal processing, and error detection.

PART-2: Simplification of Logic using Boolean Algebra

1. Problem Statement: To compare the circuits before and after simplification of
expressions using Boolean Algebra.

2. Components Requires: AND Gate, OR Gate, NOT Gate, Switches, Red Probe.

3. Theory:
Boolean Algebra is a mathematical system used to analyze and simplify digital logic
circuits. It deals with binary variables that can have only two values: 0 (LOW) and 1
(HIGH). Logical operations are performed using AND (·), OR (+), and NOT (') gates.
The main objective of Boolean Algebra is to simplify logic expressions so that digital
circuits require fewer logic gates. A simplified circuit has lower hardware cost,
consumes less power, occupies less space, and provides faster operation due to
reduced propagation delay.
In this experiment, the given Boolean expression is simplified using standard Boolean
laws such as:
 Distributive Law: A ( B+C )=AB+ AC , A+(B.C)=(A+B).(A+C)
' ' ' ' '
 De-Morgan’s Law: ( A+ B ) = A . B , ( A . B ) = A + B '
 Associative Law: ( AB ) C= A ( BC )
 Commutative Law: AB=BA , A + B=B+ A

4. Design:
Expression-1: Y= (A.B) + [(B.C).(B+C)]
= (A.B) + [B.C.B + B.C.C]
= (A.B) + [B.C + B.C]
= (A.B) + (B.C)
= B.(A+C)

Before Simplification:
a.) Truth Table:

A B C A.B B.C B+C (B.C).(B+C) (A.B)+[(B.C).(B+C)]

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

b.) Circuit Diagram:

After Simplification:
a.) Truth Table:
A B C A+C B.(A+C)
0 0 0 0 0
0 0 1 1 0
0 1 0 0 0
0 1 1 1 1
1 0 0 1 0
1 0 1 1 0
1 1 0 1 1
1 1 1 1 1

b.) Circuit Diagram:

Expression 2: Y =[A.B+B’.C]+[A.B.C’]
=(A.B)+(A.B.C’)+(B’.C)
=A.B(1+C’)+(B’.C)
=A.B+B’.C

Before Simplification:
a.) Truth Table:

A B C B’ C’ A.B B’.C A.B.C’ A.B+B’.C [A.B+B’.C]+[A.B.C’]

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

b.) Circuit Diagram:

After Simplification:

a.) Truth Table:

A B C ~B A.B ~B.C A.B+~B.C

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

b.) Circuit Diagram:

Expression 3: Y=[(~B.~C)+B.C]+A.~B
=~B.~C+A.~B+B.C
=~B.(A+~C)+B.C

Before Simplification:
a.) Truth Table:

A B C ~B ~C ~B.~C B.C ~B.~C+B.C A.~B [(~B.~C)+B.C]+A.~B

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

b.) Circuit Diagram:

After Simplification:

a.) Truth Table:

A B C ~B ~C A+~C ~B.(A+~C) B.C ~B.(A+~C)+B.C

0 0 0 1 1 1 1 0 1
0 0 1 1 0 0 0 0 0
0 1 0 0 1 1 0 0 0
0 1 1 0 0 0 0 1 1
1 0 0 1 1 1 1 0 1
1 0 1 1 0 1 1 0 1
1 1 0 0 1 1 0 0 0
1 1 1 0 0 1 0 1 1
b.) Circuit Diagram:

[Link]

Expression 1:
i) When all the inputs were high, the output was also high.
ii) When all the inputs were low, the output was also low

Expression 2:
i) When all the inputs were high, the output was also high.
ii) When all the inputs were low, the output was also low

Expression 3:
i) When all the inputs were high, the output was also high.
ii) When all the inputs were low, the output was high.

[Link]
Boolean Algebra plays a vital role in designing efficient digital circuits. By simplifying Boolean
expressions, the number of logic gates and circuit connections can be reduced without
changing the output. Some important applications are:

1. Microprocessors and Computers - Simplified logic circuits reduce the complexity of

processors and arithmetic units, resulting in faster operation and lower hardware cost.

2. Embedded Systems - Boolean simplification minimizes the number of logic gates used in
embedded devices, reducing power consumption and improving reliability.

3. Digital Control Systems - Industrial automation and control systems use simplified logic
circuits to perform operations efficiently with reduced circuit complexity.

4. VLSI and Integrated Circuit Design - Boolean Algebra is widely used in VLSI design to
optimize chip area, reduce power consumption, and improve the overall performance of
integrated circuits.