ACE INSTITUTE OF MANAGEMENT
Pokhara University
Faculty of Management
Bachelor in Computer Science and Information
Technology (BCSIT)
A LAB REPORTS ON
Course: Digital System (CMP 174)
Year/Semester: I/II
LAB 02: IMPLEMENT THE SIMPLIFIED BOOLEAN EXPRESSIONS USING LOGIC
GATES
Submitted by:
Name:
Roll:
Submitted to:
Er. Ganesh Thapa
Faculty, Department of
Computer
Science
LAB 02
IMPLEMENT THE SIMPLIFIED BOOLEAN EXPRESSIONS USING LOGIC GATES
OBJECTIVES:
To Learn how to simplify Boolean expressions using Boolean algebra rules.
To Implement the simplified Boolean expression using logic gates.
EQUIPMENT /TOOL:
Software: Digital works or Logic Gate Simulator Application
Hardware: ICs, Digital Logic Trainer Kit7404, 7400, 7432, 7408, 7402
THEORY:
Define Boolean Algebra and list all its rule
OBSERVATIONS:
Task 1: Verification of the Operation of EX-OR and EX-NOR Gate using basic Gates
Boolean expression for EX-OR gate is:
Y = 𝐀’ B + A𝐁’
o Implement the original expression using basic logic gates.
o Implement using XOR Gate
o Simulate both circuits and verify that their outputs are the same for all input
combinations.
Boolean expression for EX-NOR gate is:
Y = 𝐀 B + A’𝐁’
o Implement the original expression using basic logic gates.
o Implement using XOR Gate
o Simulate both circuits and verify that their outputs are the same for all input
combinations.
Task 2:
Given that F(A,B,C)=AB’C+ABC’+AB’C’
o Implement the original expression using basic logic gates.
o Apply Boolean algebra rules to simplify the expression. And write the final
simplified Boolean expression
o Implement the simplified expression using basic logic gates.
o Create circuit diagrams (using simulator or drawn neatly).
o Simulate both circuits and verify that their outputs are the same for all input
combinations.
.
DISCUSSION:
CONCLUSION: