You are on page 1of 9

AEROSPACE AND AVIATION CAMPUS, KAMRA

DAPARTMENT OF COMPUTER SCIENCE

DLD LAB REPORT # 02

SUBMITTED BY: FARAZ TARIQ


SUBMITTED TO: MA’AM FAIZA GUL
COURSE: BSCS-2A
SUBJECT: DIGITAL LOGIC DESIGN
DATE: 26TH MARCH, 2021
IMPLEMENTATION OF BOOLEAN FUNCTIONS
PRE LAB TASK:

1. Boolean Function:

Boolean function is an expression formed with binary


variables, the two binary operators OR and AND, the
unary operator NOT, Parenthesis, and equal sign.
Example:

F = F= X’YZ + X’YZ’ + XZ

x y z F
0 0 0 0
0 0 1 0
0 1 0 1
0 1 1 1
1 0 0 0
1 0 1 1
1 1 0 0
1 1 1 1
LAB TASK No-1

“Implement the following function using the ICs provided. Make


the truth table from the circuit and then match it with the truth
table obtained by implementing the circuit in the hardware”.

A B Y (Theoretical) Y (Practical)

0 0 0 0

0 1 1 1

1 0 1 1

1 1 0 0

The given circuit is a diagram of Exclusive OR gate and its


equation can be written as:
Y= A’B + AB’

Schematic Diagram:
• For state 0,0:

• For state 1,1:

• For state 1,0:


• For state 0,1:

Hence both the tables theoretically as well as practically


with the help of simulator are giving same results.
2- Using the function mentioned above:

F= X’YZ + X’YZ’ + XZ
X Y Z F(Theoretical) F(Practical)

0 0 0 0 0

0 0 1 0 0

0 1 0 1 1

0 1 1 1 1

1 0 0 0 0

1 0 1 1 1

1 1 0 0 0

1 1 1 1 1
Schematic Diagrams:
• State 0,0,0:

• State 0,0,1:

• State 0,1,0:

• State 0,1,1:
• State 1,0,0:

• State 1,0,1:

• State 1,1,0:

• State 1,1,1:
• RESULT:

Hence both the tables theoretically as well as practically with


the help of simulator are giving same results.

You might also like