Scribd
Upload
64 views

Tutorial 4

The document contains examples of simplifying Boolean expressions using Karnaugh maps. It includes steps to prove expressions, simplify expressions, find minterms, identify prime implicants, and convert between sum of products and product of sums forms. There are multiple multipart examples provided.

Uploaded by

Aina Najihah
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
64 views

Tutorial 4

The document contains examples of simplifying Boolean expressions using Karnaugh maps. It includes steps to prove expressions, simplify expressions, find minterms, identify prime implicants, and convert between sum of products and product of sums forms. There are multiple multipart examples provided.

Uploaded by

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

WIX1003/WXES 1109 COMPUTER SYSTEMS & ORGANIZATION

TUTORIAL 4

Instruction: Show the complete working steps

1. Prove the expression below using Karnaugh. map


a) ABC + ABC + ABC + ABC = AB+BC

C/AB 00 01 11 10
0 1
1 1 1 1

F1 = AB + BC

b) ABC + ABC + ABC + ABC + ABC = B+AC

C/AB 00 01 11 10
0 1 1 1
1 1 1

c) xy + xy + xy = x+ y

X\Y 0 1
0 1 1
1 1

2. Simplify the following Boolean expression using K-map


a) F(X,Y,Z)= m(3,4,6,7)

X\YZ 00 01 11 10
0 1
1 1 1 1

F= XYZ + YZ + XYZ

b) F(X,Y,Z)= m(0,2,4,5,6)

X\YZ 00 01 11 10
0 1 1
1 1 1 1

F = YZ + XYZ + YZ
c) F(A,B,C,D)= m(0,1,2,4,5,6,8,9,12,13,14)

AB\CD 00 01 11 10
00 1 1 1
01 1 1 1
11 1 1 1
10 1 1

F= AC + ABD + AC + BCD

3. Simplify the following expression using K-map


a) AB+ABC+ABC

A\BC 00 01 11 10
0
1 1 1 1

b) A+BC

A\BC 00 01 11 10
0 1
1 1 1

c) ABCD+ACD+BCD+ABCD

AB\BC 00 01 11 10
00
01 1 1
11 1 1
10 1 1

d) AB+ABCD+CD+BCD+ABCD

AB\BC 00 01 11 10
00 1
01
11 1 1
10 1 1 1
4. Find minterm by plotting it on the map:
a) XY+XZ+XYZ

X\YZ 00 01 11 10
0 0 0 1 0
1 0 1 1 1

b) BD+ABD+ABC

AB\BC 00 01 11 10
00 1 0 0 0
01 0 0 1 1
11 0 0 1 1
10 0 0 1 0

5. Draw K-map to find all prime implicants (PI) and identify which are essential.
a) F(W,X,Y,Z)= m(0,2,5,7,8,10,12,13,14,15)

WX\YZ 00 01 11 10
00 1 1
01 1 1
11 1 1 1
10 1 1

F1 = XYZ + XYW+ WXZ + WXZ (ESSENTIAL)

WX\YZ 00 01 11 10
00 1 1
01 1 1
11 1 1 1
10 1 1

F2 = WXZ + XYZ + WZ + WXY

EPI = XYZ
PI = XYZ, XYW, WXZ, WXZ, WXZ, XYZ, WZ, WXY

b) F(A,B,C,D)= m(0,2,3,5,7,8,10,11,14,15)
AB\CD 00 01 11 10
00 1 1 1
01 1 1
11 1 1
10 1 1 1

F1= BCD + ACD + BCD + ABC +

6. Convert the following product-of-sum (POS) forms to sum-of-products (SOP)


forms using Karnaugh map.
a) (A+B)(A+C)(A+B+C)
(A+B)(C+C)(A+C)(B+B)(A+B+C)
(A+B+C)(A+B+C)(A+B+C)(A+B+C)(A+B+B)

A\BC 00 01 11 10
0 1
1 1 1 1

Hence,
A\BC 00 01 11 10
0 1 1 1
1 1

= m(0,2,3,7)

b) (A+B)(A+B+C)(B+C+D)(A+B+C+D)
= (A+B+C+D)(A+B+C+D)(A+B+C+D)(A+B+C+D)
(A+B+C+D)(A+B+C+D)(A+B+C+D)(A+B+C+D)
(A+B+C+D)

AB\CD 00 01 11 10
00 1 1
01 1 1 1 1
11 1
10 1

HENCE,
AB\CD 00 01 11 10
00 1 1
01
11 1 1 1
10 1 1 1
= m(2,3,7,8,9,11,14,15)
7. Simplify F function with dont care condition d. Find all PI and EPI(Essential
Prime Implicants)
a) F(A,B,C)= m(3,5,6), d(A,B,C)=m(0,7)

A\BC 00 01 11 10
0 X 1
1 1 X 1

F= ABC +ABC +ABC

PI=m(3,7) significant
=m(6,7) significant
=m(5,7) significant

b) F(W,X,Y,Z)= m(0,2,4,5,8,14,15), d(W,X,Y,Z)= m(7,10,13)

A\BC 00 01 11 10
00 1 1
01 1 1 X
11 X 1 1
10 1 X

F = WXYZ +WXYZ +WXYZ + WXYZ + WXYZ +WXYZ


S= WXYZ + XYZ + WXYZ + XZ +WYZ

PI = m (5,7,13,15) significant
= m (14,15) not significant
= m (10,14) significant
= m (4,5) not significant
= = m (0,4) significant

You might also like