St.

Xavier’s College
Maitighar, Kathmandu

LAB REPORT 5: To verify the universality of NAND gate and NOR gate

(COMPUTER SCIENCE)

SUBMITTED BY: SUBMITTED TO:

NAME: Kripal Shrestha

GRADE: BIM 1st semester (Anil sir)

DATE : 9st October 2018 Digital Logics lecturer

Department of computer science

KATHMANDU, NEPAL
2018
 A Project On
Boolean algebra

Submitted as a partial fulfillment of requirement of the curriculum of

BIM 1st semester under TU

Submitted By:
Kripal Shrestha

Under Supervision Of
Anil shah sir

Date:
29th October 2018

St. Xavier’s College

Maitighar, Kathmandu
Nepal

Roll No: 018BIM021 St. Xavier’s college, Maitighar

2|Page
TITLE: To verify the universality of NAND gate and NOR gate.
Principle:
Universal gates are those which could be combined together to form any other
gate. The NAND or NOR gates can represent any complete Boolean Function
without using any other gates. So it is possible to implement any logic
expression using only NAND gates or NOR gates.

Objective #1: NAND gate as NOT gate:

Theory:
PRINCIPLE:
According to the theory of NOT gate, it produces output which is
the compliment of its input. And as NAND gate has 2 input but can produce
same output as NOT gate by combining one input with other input.

Observation:

3|Page
OBSERVATION TABLE:

INPUT A NAND = (A.A)’ NOT ( F= A’)

0 1 1
1 0 0

Hence, NAND = NOT (both operation produce same output)

Objective #2: NAND gates as AND gates

THEORY:
PRINCIPLE:
The NAND Function is the complement of the AND function. So function of
AND gate can be performed by NAND gate. NAND gate also produce high (0)
output when all the inputs are high.

OBSERVATION:

4|Page
OBESRVATION TABLE:

INPUT A INPUT B NAND=(AB’)’ AND =(A.B)

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

Hence, NAND = AND (both operation produce same output).

Objective #3: NAND gate as OR gate

Theory:
PRINCIPLE:
OR gate produce high output if one of the input is high (1). NAND gate can
produce same output as OR gate by using 3 NAND gates.

Observation:

Observation table:
5|Page
 INPUT A INPUT B
0 0
0 1
1 0
1 1
NAND =(A’B’)’ OR = (A+B)
0 0
1 1
1 1
1 1

Objective #4: NOR gate as NOT Gate

THEORY:

PRINCIPLE:

The logic gate NOT produces output as the complement of its input and to
produce same output as NOT gate, NOR gate takes the complement of the sum
of the input as NOR does gate have 2 inputs.

OBESRVATION:

6|Page
OBSERVATION TABLE:
INPUT A NOR= (A+A)’ NOT = (A’)
0 1 1
1 0 0

Objective #5: NOR gate as AND gate.

Theory:

PRINCIPLE:

AND gate produce high output only if all of the input is high. And NOR gate
perform the function of AND gate by using 3 NOR gates.

Observation:

7|Page
Observation table:

INPUT A INPUT B NOR =(A’+B’)’ OR = (A.B)

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

Objective #6: NOR gate as OR gate.

Theory:
PRINCIPLE:
OR gate produce high output if one of the input is high. And
NOR gate is the combination of OR and NOT gate so it produces
same output as OR gate using two NOR gates.

Observation Table:

8|Page
OBSERVATION TABLE:

INPUT A INPUT B NAND =((A+B)’)’ OR = (A+B)

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

CONCLUSION:
So from the above verification it can be easily shown that any Boolean
function can be implemented either using NAND or NOR gate Alone and the
gates can be verified in terms of truth table and logic diagram. That’s why
NAND and NOR gates are known as universal gates.

REFERENCE:
1. Reference Books
2. Google
3. YouTube
4. Reference sites

9|Page