Gift University Gujranwala Electrical Engineering

GIFT UNIVERSITY GUJRANWALA

LAB MANUAL
DIGITAL LOGIC DESIGN
DEPARTMENT OF ELECTRICAL ENGINEERING

Digital Logic Design

Gift University Gujranwala Electrical Engineering

Derivation of Boolean Function

From Truth Table Using MINTERMS,
Simplifications & Verification
EXPERIMENT NO. 05

Name & ID Report Lab Performance Viva Marks Total

Marks (06) (05) (15)
(04)
Ehtasham Maqbool - 231400033

M Bilal- 231400038

Hammad Hassan Cheema –

231400045

Masab Rehman -231370262

Digital Logic Design Page 1

Gift University Gujranwala Electrical Engineering

EXPERIMENT NO. 05

Derivation of Boolean Function from Truth Table Using Minterms,

Simplifications & Verification
Objectives

 Learn how to write a function using Minterms.

 Gates reduction by function simplification.

Theory

Minterms provide a way to represent any Boolean function algebraically, once its truth table is
specified. The function is given by the sum (OR) of those Minterms corresponding to rows where
the function is 1. By the Minterms property, the OR will contain a term equal to 1 (making the
function 1) on exactly those rows where the function is supposed to be 1.
====================================================================

LAB TASK
====================================================================
Write the Function F1 & F2 from given below Truth Table using MINTERMS and simplify
them.

Sr. x y z F1 F2

0 0 0 0 0 0

1 0 0 1 1 0

2 0 1 0 0 0

3 0 1 1 1 1

4 1 0 0 0 1

Digital Logic Design Page 2

Gift University Gujranwala Electrical Engineering

5 1 0 1 1 1

6 1 1 0 0 0

7 1 1 1 1 0

Follow the following steps:

1. Write the Minterms of the column where the function F1 is given in truth table.
2. Simplify the function.
3. Draw the Logic diagram on LOGISIM.
========================================================================
Function # 01
======================================================================================
Function: (01 Mark)

X’Y’Z + X’YZ +XY’Z +XYZ

Simplification:
(01Mark)

X’Z(Y+Y’) + XZ(Y+Y’)
X’Z +XZ
Z(X+X’)
Z

Logic diagram of Derived Function F1 (Screenshot of LOGISIM): (0.5

Marks)

Digital Logic Design Page 3

Gift University Gujranwala Electrical Engineering

Hardware circuit of simplified Function F1 (Screenshot of Hadware): (0.5 Marks)

========================================================================
Function # 02
======================================================================================

Function: (01 Mark)

X’YZ + XY’Z’+XY’Z

Simplification:
(01Mark)

X’YZ + XY’(Z+Z’)
X’YZ + XY’

Digital Logic Design Page 4

Gift University Gujranwala Electrical Engineering

Logic diagram of Derived Function F2 (Screenshot of LOGISIM): (0.5

Marks)

Hardware circuit of simplified Function F2 (Screenshot of Hardware): (0.5 Marks)

Observations: (01
Mark)
Digital Logic Design Page 5
Gift University Gujranwala Electrical Engineering

In this lab we learned to make minterms of a function and

write the minterms in variables. We also learned to simplify functions
using Boolean Algebra. We also learned about Maxterms.

1. What do you understand by truth table and truth function? How these are related?
(0.5 Marks)

A truth table is a chart that shows all possible combinations of truth values for a logical
expression. A truth function is a rule that assigns a truth value to each combination of
truth values in a truth table. They are related because a truth table illustrates how a
truth function behaves for all possible inputs._________________________________

2. What do you mean by “Logical Functions”? Give some real life examples that best describe
them. (0.5 Marks)

Logic Functions are simple rules that work with 1 and 0 or True and False Values. For
Example AND Logic Gate requires both condition to be true. For example an alarm that
turns on when 2 doors of a car are opened. OR requires one condition to be true. Like a
whole alarm that turns on when there is a fire in one place. NOT simply reverses the
condition

3. Explain the significance of truth table. (0.5 Marks)

Truth table is very significant. It can be used to derive output of a function. It

can also be used to make Minterms or Maxterms. We can understand the
working of a logic circuit by a truth table

4. Consider the following situation (1.5 Marks)

Four chairs A, B, C and D are placed in a row. Each chair may be occupied (“1”) or empty

Digital Logic Design Page 6

Gift University Gujranwala Electrical Engineering

(“0”). A Boolean function “F” is 1 if and only if there are two or more adjacent chairs are
occupied.
a) Give the truth table defining this Boolean function F.
b) E x p r e s s F in terms of Algebraic Function using minterm.
c) Simplify the result and show its equivalent circuit diagram

A B C D F

0 0 0 0 0

0 0 0 1 0

0 0 1 0 0

0 0 1 1 1

0 1 0 0 0

0 1 0 1 0

0 1 1 0 1

0 1 1 1 1

1 0 0 0 0

1 0 0 1 0

1 0 1 0 0

1 0 1 1 1

1 1 0 0 1

1 1 0 1 1

1 1 1 0 1

Digital Logic Design Page 7

Gift University Gujranwala Electrical Engineering

1 1 1 1 1

Digital Logic Design Page 8

Gift University Gujranwala Electrical Engineering

A’B’CD + A’BCD’ + A’BCD + AB’CD + ABC’D’ + ABC’D + ABCD’ + ABCD

SIMPLIFICATION: -
= A′B′CD+A′BCD+A′BCD′+AB′CD+ABC′D+ABC′D′+ABCD+ABCD′
= A′C(D+D′) + AB′C(D+D′) + AB(D+D′) + ABC′(D+D′)
= A′C(1) + AB′C(1) + AB(1) + ABC′(1)
= A′C + AB′C + AB + ABC′
= C(A′+AB′) + AB(1+C′)
= C(A′+B′) + AB
= CA’ + CB’ + AB

Digital Logic Design Page 9