National University of Modern

Languages Sector H-9,

Islamabad, Pakistan.

Department of Computer Science

Course Title: Digital Logic Design

Student Name: Nayyab Malik Roll Number: BS AI- 127

Lab Number: 3 Date: 8TH march,2023

Lab Assessment Rubrics

Method: Lab report and instructor observation during Lab session

Outcome Assessed:

a. Ability to solve and demonstrate solutions (Cognitive).

b. Ability to apply and comprehend modern engineering tools to develop skills for
engineering knowledge (Psychomotor).
c. Ability to design report and documentation (Affective).

Cognitive Domain Affective Domain Psychomotor Domain

Previous Class Project Report Weekly Lab Tasks/

Discussions/ Real Time Writing Mid Term Evaluation/
Marks Obtained

Examples/ Viva-Voce Final Project

Total

0.25 0.25 0.5 - 1

1

Instructor’s Signature:

TABLE OF CONTEN
T

Simplify Boolean Expressions and Maximum Numbers of Literals......................................................3

Objectives..............................................................................................................................................3
Boolean Expressions..............................................................................................................................3
Literals...................................................................................................................................................3
1.AB+A(B+C)+B(B+C)........................................................................................................................3
 Truth Table:..............................................................................................................................3
 Logic Gate:................................................................................................................................4
2.AB+AC(D+D’)...................................................................................................................................4
 TRUTH TABLE:......................................................................................................................4
 Logic gate:.....................................................................................................................................5
3.(A’+B’)(A+C’)+B’(B+C):..................................................................................................................5
 TRUTH TABLE:......................................................................................................................5
 Logic gate:.....................................................................................................................................6
Conclusion.............................................................................................................................................7
 Simplify Boolean Expressions and Maximum Numbers of Literals

Objectives:
 Learn to simplify Boolean expressions and maximum number of literals
 Learn to verify Boolean expressions and their simplified form using logic gates and truth
tables

Boolean Expressions:
“A Boolean expression is a logical statement that is either TRUE or FALSE”
Boolean expressions can compare data of any type as long as both parts of the expression
have the same basic data type.

Literals:
“A literal is a variable or the complement of a variable.”
1. AB+A(B+C)+B(B+C)

=AB+AB+AC+B.B+BC

=AB+AC+B+BC ∴AB+AB=AB;B.B=B
=AB+B+AC+BC
=B(A+1)+AC+BC ∴A+1=A
=B+AC+BC
=B+BC+AC
=B(1+C)+AC ∴1+C=1
=B+AC

 Truth Table:

A B C AB (B+C) A(B+C) B(B+C) F AC F

0 0 0 0 0 0 0 0 0 0
0 0 1 0 1 0 0 0 0 0
0 1 0 0 1 0 1 1 0 1
0 1 1 0 1 0 1 1 0 1
1 0 0 0 0 0 0 0 0 0
1 0 1 0 1 1 0 1 1 1
1 1 0 1 1 1 1 1 0 1
1 1 1 1 1 1 1 1 1 1
 Logic Gate:

A B+AC
C
B

AB+A(B+C)+B(B+C)
A
B

B A(B+C)
C +B(B+C)
A

B
C
B

2. AB+AC(D+D’)
=AB+ 1 AC ∴D+D’=
=A(B+C)

 Truth Table:

A B C B+C A(B+C) AB AC AB+AB

0 0 0 0 0 0 0 0
0 0 1 1 0 0 0 0
0 1 0 1 0 0 0 0
0 1 1 1 0 0 0 0
1 0 0 0 0 0 0 0
1 0 1 1 1 0 1 1
1 1 0 1 1 1 0 1
1 1 1 1 1 1 1 1
  Logic Gate:

A(B+C)
B

A
B AB+AC

A
C

3. (A’+B’)(A+C’)+B’(B+C):
=A’A+A’C’+B’A+B’C’+B’B+B’C ∴A’A=0
=A’C’+B’A+B’C’+B’C
=A’C’+B’A+B’(C’+C) ∴C’+C=1
=A’C’+B’C+B’
=A’C’+B’(1+C) ∴1+C=1
=A’C’+B’
 Truth Table:
A B C A’ B’ C’ A’+B A+C’ (A’+B’)(A+C’) B+C B’(B+C F
’ )
0 0 0 1 1 1 1 1 1 0 0 1
0 0 1 1 1 0 1 0 0 1 1 1
0 1 0 1 0 1 1 1 1 1 0 1
0 1 1 1 0 0 1 0 0 1 0 0
1 0 0 0 1 1 1 1 1 0 0 1
1 0 1 0 1 0 1 1 1 1 1 1
1 1 0 0 0 1 0 1 0 1 0 0
1 1 1 0 0 0 0 1 0 1 0 0
 A B C A’ B’ C’ A’C A’C’+B’
0 0 0 1 1 1 1 1
0 0 1 1 1 0 0 1
0 1 0 1 0 1 1 1
0 1 1 1 0 0 0 0
1 0 0 0 1 1 0 1
1 0 1 0 1 0 0 1
1 1 0 0 0 1 0 0
1 1 1 0 0 0 0 0

 Logic Gate:

A
’ (A’C’)

C A’C’+B’
’

B
’

A
’
(A’+B’)
B
(A+C’)
’
(A’+B’)(A+C’)
C +B’(B+C)
’ A
B B’(B+C)
C B
’
Conclusion:
In this lab, we are able to simplify Boolean expressions and maximum number of literals. We verify
simplified expressions using truth table and logic gates that proves, their output remain same as
Boolean expression has.