CERTIFICATE

ACKNOWLEDGEMENT
 INDEX
1. CERTIFICATE
2. ACKNOWLEDGEMENT
3. OBJECTIVE
4. APPARATUS REQUIRED
5. THEORY-
*LOGIC GATES
*TYPES OF LOGIC GATES
6. PROCEDURE
7. RESULT
8. BIBLIOGRAPHY
OBJECTIVE:

To design an appropriate logic gate

combination for a given truth table
APPARATUS:

A battery of 6 V, two switches, torch bulb,

connecting wires.
LOGIC GATES

A gate is defined as a digital circuit which follows some

logical Relationship between input and output voltages. It is a
digital circuit which either allows a signal to pass through as
stop, it is called a gate.

The logic gates are building blocks at digital electronics. They

are used in digital electronics to change on voltage level
(input voltage) into another (output voltage) according to
some logical statement relating them.

A logic gate may have one or more inputs but it has only one
output. The relationship between the possible values of input
and output voltage is expressed in the form of a table called
truth table or table of combination.

Truth table of a logic gate is a table that shows all the input
and output possibilities for the logic gate.
George Boole in1980 invented a different kind of algebra
based on binary nature at the logic, called Boolean Algebra. A
logical statement can have only two values, such as HIGH/
LOW, ON/ OFF, CLOSED/ OPEN, YES/ NO, TRUE/ FALSE, etc.
the two values of logic statements are denoted by the binary
numbers 1 and 0. 1 denotes the high value and 0, the low
value. The logical statements that logic gates follow are
called Boolean expressions.

TYPES OF LOGIC GATES

Any Boolean algebra operation can be associated with inputs

and outputs representing the statements of Boolean algebra.
Although these circuits may be complex they may all be
constructed from three basic devices.

We have three different types of logic gates-OR, AND, NOT.

The three basic logic gates and their combination are the
building block of the digital circuit.

1. OR-gate.The symbol and truth table for OR-gate are

shown in figure respectively.
Input Output
A B Y=A+B
0 0 0
1 0 1
0 1 1
1 1 1

2. AND-gate. The symbol and truth table for AND-gate are

shown in figures respectively.

Input Output
A B Y=A.B
0 0 0
1 0 0
0 1 0
1 1 1
 3. NOT-gate. The symbol and truth table for NOT-gate are
shown in figures respectively.

Input Output
A Y=𝐴̅
0 1
1 0
PROCEDURE

Write product term for each input (minterm). Combination

where Boolean function has output 1. While writing minterm,
complement that variable whose value is 0 otherwise write it
in direct form (without complement).

1. Add all the minterms to obtain the Boolean function.

2. Draw the circuit using BASIC LOGIC Gates.

(a)
X Y F Minterm
0 0 1 𝑥̅ . 𝑦̅
0 1 0 -
1 0 0 -
1 1 1 x.y
The Boolean function F(X, Y) is obtained as:
 F(X, Y) = 𝑋̅ . 𝑌̅+ X . Y
∴ Logic circuit is: