Scribd
Upload
8 views2 pages

Experiment No 2

The document outlines Experiment No. 02, focusing on the implementation of Boolean functions using XOR, AND, OR, and NOT gates. It details the objectives, equipment needed, and two specific Boolean functions (F1 and F2) along with their truth tables. The experiment aims to understand Boolean principles, verify truth tables, analyze input-output relationships, and design circuit diagrams.

Uploaded by

sakibahamedshihab
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
8 views2 pages

Experiment No 2

The document outlines Experiment No. 02, focusing on the implementation of Boolean functions using XOR, AND, OR, and NOT gates. It details the objectives, equipment needed, and two specific Boolean functions (F1 and F2) along with their truth tables. The experiment aims to understand Boolean principles, verify truth tables, analyze input-output relationships, and design circuit diagrams.

Uploaded by

sakibahamedshihab
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Experiment No: 02

Experiment Name:
Implementation of Boolean Functions Using XOR, AND, OR, and NOT Gates

Objectives
• To understand the working principles of Boolean functions.

• To construct and verify the truth tables for the given Boolean functions.

• To analyze the relationship between inputs and outputs for each function.

• To design the corresponding circuit diagrams for both functions.

Equipment
The following equipment is used in this experiment:

• XOR gate

• AND gate

• OR gate

• NOT gate

Description
Given Boolean Functions

1. F1 = (X ⊕ Y)(Y'Z') :

• This function uses XOR (⊕), NOT (′), and AND (⋅) operations.

• The output is 1 when X⊕Y is 1 and Y′Z′ is also 1.

2. F2 = XYZ + X'Z' + Y' :

• This function uses AND (⋅), OR (+), and NOT (′) operations.

• The output is 1 if any of the terms XYZ, X′Z′, or Y′ is 1


Truth Table

X Y Z X⊕Y Y’ Z’ F1=(X⊕Y).(Y’Z’) XYZ X’Z’ Y’ F2=XYZ+X’Y’+Y’


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

Software Simulation

You might also like