CS-(129L) BCS-109

LAB #6
BOOLEAN FUNCTION BY LOGIC GATES
Objective:
Reproduce the following Boolean functions using basic logic gates.
a) A + A’B
b) AB + BC (B +C)
c) ((A + BC)’ + (A.B’)’)’

Software Required:
Electronic Workbench

Theory:
Boolean Algebra Expressions can be used to construct digital logic truth tables for their
respective functions. As well as a standard Boolean Expression, the input and output
information of any Logic Gate or circuit can be plotted into a standard table to give a
visual representation of the switching function of the system. The table used to represent
the Boolean expression of a logic gate function is commonly called a Truth Table. A
logic gate truth table shows each possible input combination to the gate or circuit with the
resultant output depending upon the combination of these input(s).
Experiment:
Construct the circuit as shown in Figure 6.1, 6.2 and 6.3. Apply inputs A, B, C and check
the output F then complete the truth table 6-1 to 6-3 for the given Boolean function.
a) A + A’B
b)

Figure 6.1 Boolean Functions and its Logic Circuit.

DEPARTMENT OF COMPUTER SCIENCE & INFORMATION TECHNOLOGY
SIR SYED UNIVERSITY OF ENGINEERING & TECHNOLOGY
CS-(129L) BCS-109

Table 6.1: Truth table for the above given Boolean function
A B A + A’B (A + B )

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

c) AB + BC (B +C)

Figure 6.2 Boolean Functions and its Logic Circuit.

Table 6.2: Truth table for the above given Boolean function.
A B C Q1 Q2

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

DEPARTMENT OF COMPUTER SCIENCE & INFORMATION TECHNOLOGY

SIR SYED UNIVERSITY OF ENGINEERING & TECHNOLOGY
CS-(129L) BCS-109

d) (A + BC)’ + (A.B’)’)’

Figure 6.3 Boolean Function and its Logic Circuit.

Table 6.3: Truth table for the above given Boolean function.
A B C Q1 Q2

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

Conclusion:

DEPARTMENT OF COMPUTER SCIENCE & INFORMATION TECHNOLOGY

SIR SYED UNIVERSITY OF ENGINEERING & TECHNOLOGY