Professional Documents
Culture Documents
BMT-264
Lab Instructor:
Name: ____________________
EXPERIMENT No. 01
PRE-LAB TASK
Objectives
Introduction
Gates, more specifically Logic Gates, are the type of digital circuit that process signals which
are represented as 1 or 0. Usually the positive supply voltage +5V is represented as 1 and 0V
(Ground) is represented as 0. These ‘1’ and ‘0’ are known as Logic States. Other terms that are
used for 1 and 0 states are shown in the table below.
Logic States
1 0
+5V 0V
True False
High Low
On Off
Theory
There are three main types of logic gates which are further subdivided. These categories are
based on their function. Logic gates are usually expressed in capital letter in order to make it
clear that the term refers to a logic gate. The main types and their subdivision are listed as:
I. Basic Gates:
1|Page
LAB-01
a) AND Gate
b) OR Gate
c) NOT Gate
II. Universal Gates:
a) NAND Gate
b) NOR Gate
III. Combinational Gates:
a) XOR Gate
b) XNOR Gate
AND Gate
It is the type of logic circuit that gives a logic state ‘1’ as output only if all inputs are at logic
state ‘1’. This function is denoted by dot (.). So the Boolean expression for AND Gate is given
as:
𝐺 = 𝐴. 𝐵 = 𝐴𝐵
OR Gate
The OR gate is an electronic circuit that gives ‘1’ as output if one or more of its inputs are at
logic state 1. A plus sign (+) is used to show the OR operation. It’s expression is given as:
𝐺 =𝐴+𝐵
2|Page
LAB-01
NOT Gate
The NOT gate is an electronic circuit that produces an inverted version of the input at its
output. It is also known as an inverter. This gate is unique in this sense that it has only one input.
If the input, let us say A, is ‘1’, the output is ‘0’ and if the input is ‘0’ the output is ‘1’. This
inverted output is known as NOT A. It is expressed as:
𝐺 = 𝐴̅ = 𝐴΄
NAND Gate
It is a NOT-AND gate which is equal to an AND gate tailed by a NOT gate. The output of this
logic gate is ‘1’ whenever any of its inputs are ‘0’. Its Boolean expression is:
𝐽 = ̅̅̅̅
𝐴𝐵
NOR Gate
It is a NOT-OR gate which is equivalent to an OR gate tailed by a NOT gate. The output of
NOR gate is ‘0’ whenever any of the inputs are ‘1’. Its expression is:
̅̅̅̅̅̅̅̅
𝐽=𝐴 +𝐵
3|Page
LAB-01
XOR Gate
The 'Exclusive-OR' gate is a logic circuit that will give a ‘1’ as output if either, but not both, of
its two inputs are ‘1’. An encircled plus sign (⊕) is used to show the X-OR operation. The
expression and symbol of this gate are as under:
𝑅 =𝐴⊕𝐵
XNOR Gate
The 'Exclusive-NOR' gate reverse to the X-OR gate. It will give a ‘0’ output if either, but not
both, of its two inputs are ‘1’. The expression and symbol of this gate are:
𝑅 = ̅̅̅̅̅̅̅̅
𝐴⊕𝐵
LAB SESSION
4|Page
LAB-01
➢ 7408 IC
➢ 7432 IC
➢ 7400 IC
➢ 7402 IC
➢ 7486 IC
➢ 74266 IC
Experimental Procedure
Observations
NOT GATE:
Input Output
E G
0
1
AND GATE:
5|Page
LAB-01
Inputs Output
E F G
0 0
0 1
1 0
1 1
OR GATE:
Inputs Output
E F G
0 0
0 1
1 0
1 1
NAND GATE:
Inputs Output
H I J
0 0
0 1
1 0
1 1
NOR GATE:
Inputs Output
H I J
0 0
0 1
1 0
1 1
XOR GATE:
Inputs Output
P Q R
0 0
6|Page
LAB-01
0 1
1 0
1 1
XNOR GATE:
Inputs Output
P Q R
0 0
0 1
1 0
1 1
Questions:
7|Page
LAB-01
LAB REPORT
Discussion of Results:
1. Can the output of one logic gate be used as input for other gates? Give reason.
_______________________________________________________________________
_______________________________________________________________________
_______________________________________________________________________
_______________________________________________________________________
2. Draw the symbolic diagram and complete the truth table for the following expression.
𝑫 = 𝑷𝑸 + 𝑷′ 𝑸 + 𝑷𝑸′ + 𝑷′𝑸′
How many gates are required to implement the above expression? __________________
P Q D
0 0
0 1
1 0
1 1
Conclusion/Summary:
______________________________________________________________________________
______________________________________________________________________________
______________________________________________________________________________
______________________________________________________________________________
______________________________________________________________________________
______________________________________________________________________________
______________________________________________________________________________
8|Page