Scribd
Upload
106 views4 pages

Module 26 - Exercises On K-Map Simplification With Don't-Care Values

The document discusses exercises on K-map simplification with don't care values. It contains 3 exercises involving simplifying Boolean functions with don't care conditions and simplifying a truth table in sum of products and product of sums form.

Uploaded by

renzo aranzaso
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
106 views4 pages

Module 26 - Exercises On K-Map Simplification With Don't-Care Values

The document discusses exercises on K-map simplification with don't care values. It contains 3 exercises involving simplifying Boolean functions with don't care conditions and simplifying a truth table in sum of products and product of sums form.

Uploaded by

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

Module 26

Exercises on K-map Simplification with Don’t Care Values

MODULE
26
Exercises on K-map Simplification
with Don’t-Care Values

At the end of this module, the students


should be able to:

1. fully understand and apply the concepts


learned in the previous modules

2. solve related problems

FEU – East Asia College


CPE103 – Logic Circuits and Switching Theory 1
Module 26
Exercises on K-map Simplification with Don’t Care Values

EXERCISES ON K-MAP SIMPLIFICATION


WITH DON’T-CARE VALUES

1. Simplify the following Boolean function F together with


the don’t care conditions d; then express the simplified
function in sum of minterms.

(a) F (x, y, z) = Σ (0, 1, 2, 4, 5)


d (x, y, z) = Σ (3, 6, 7)

(b) F (A, B, C, D) = Σ (0, 6, 8, 13, 14)


d (A, B, C, D) = Σ (2, 4, 10)

(c) F (A, B, C, D) = Σ (1, 3, 5, 7, 9, 15)


d (A, B, C, D) = Σ (4, 6, 12, 13)

FEU – East Asia College


CPE103 – Logic Circuits and Switching Theory 2
Module 26
Exercises on K-map Simplification with Don’t Care Values

2. Simplify the Boolean function F together with the


don’t-care conditions d in SOP and POS.

(a) F (w, x, y, z) = Σ (0, 1, 2, 3, 7, 8, 10)


d (w, x, y, z) = Σ (5, 6, 11, 15)

(b) F (A, B, C, D) = Σ (3, 4, 13, 15)


d (A, B, C, D) = Σ (1, 2, 5, 6, 8, 10, 12, 14)

FEU – East Asia College


CPE103 – Logic Circuits and Switching Theory 3
Module 26
Exercises on K-map Simplification with Don’t Care Values

3. Simplify the truth table shown below in SOP and POS


forms.

Seven-Segment Display
B3 B2 B1 B0 a b c d e f g
0 0 0 0 1 1 1 1 1 1 0
0 0 0 1 0 1 1 0 0 0 0
0 0 1 0 1 1 0 1 1 0 1
a 0 0 1 1 1 1 1 1 0 0 1
0 1 0 0 0 1 1 0 0 1 1
f b 0 1 0 1 1 0 1 1 0 1 1
0 1 1 0 1 0 1 1 1 1 1
g 0 1 1 1 1 1 1 0 0 0 0
1 0 0 0 1 1 1 1 1 1 1
e c 1 0 0 1 1 1 1 1 0 1 1
1 0 1 0       
d 1 0 1 1       
1 1 0 0       
1 1 0 1       
1 1 1 0       
1 1 1 1       

FEU – East Asia College


CPE103 – Logic Circuits and Switching Theory 4

You might also like