1

Branch:CS & IT Hinglish

Subject : Digital Logic
Minimization
DPP-02
K-Map Basic
1. For the given Boolean function f (A, B, C) = 5. The simplified SOP form of the k-map is

m ( 0,1,5,6)
Simplified output will be
(a) AB + BC + ABC
(b) AB + BC + ABC
(c) AB + BC + ABC
(d) AB + BC + ABC
(a) xz +wxy (b) x
2. For the given Boolean function f(A, B, C) = (c) wx+wx (d) x z

m (1,3,6,7) + d (0,2) simplified output will be

(a) A + B 6. The Boolean function f (A, B, C, D) =

(b) B + C m (5,7,9,11,13,15) is independent of variables

(c) A + B (a) A (b) C
(d) AC + AB (c) B (d) B and C

3. What is the other canonical form of the given function 7. The simplified Boolean function is

f (A, B, C) = m (0,1,2,3,4,5,6,7)
(a) f ( A,B,C) = M (0,1,2,3,4,5,6,7)

(b) f (A, B, C) = M (0, 2, 4, 7)

(c) f ( A,B,C) = M (1,2,4,7)

(d) Does not exist

(a) A  B  C (b) A  B C
4. The product of all the maxterms of a givne Boolean (c) A B C (d) A BC
function is always equal to _________?
(a) 0
(b) 1
(c) 2
(d) Complement of the function
 2

8. The simplified Boolean expression f (w, x, y, z) = 10. The simplified expression of k-map is independent of

m ( 0,2,5,9,15) +d (6,7,8,10,12,13)

variables

(a) x z + w y+xz (b) x z + w y + x z

(c) x z + w y+xz (d) x z + w y + x z

9. The minimum number of NAND gate required to

simplify k-map
(a) A (b) B
(c) C (d) A, B and C

(a) 4 (b) 5
(b) 3 (d) 9
 3

Answer Key
1. (b) 7. (b, d)
2. (c) 8. (a)
3. (d) 9. (b)
4. (a) 10. (d)
5. (b)
6. (b)
 4

Hints and Solutions

1. (b) 4. (a)

Given: f (A, B, C) = m ( 0,1,5,6) The product of all the max terms is always zero.

5. (b)
3 variable k-map
Given: k-map

The simplified output expression f (A, B, C) =

A B + BC + ABC
f ( w,x, y,z) = x
2. (c)
6. (b)
Given: f (A, B, C) = m (1,3,6,7) + d (0,2) k-map of 4-variables

3-variable k-map

( A,B,C) = A + B

3. (d) f (A, B, C, D) = BD + AD

Given: f ( A,B,C) = m ( 0,1,2,3,4,5,6,7 )  function is independent of C.

In these functions are min terms are covering.

The relation between min terms and max terms is

xj = xj

 Hence max term does not exist

 5

7. (b, d) 9. (b)

f ( A,B,C) = ABC + ABC + ABC + ABC f ( A,B,C) = AB + AB

f ( A,B,C) = A ( B C) + A ( B  C) f ( A,B,C) = A B

f ( A,B,C) = A B( )
C + A ( B  C) Hence 5 NAND gate required

f ( A,B,C) = A ( B (
C) + A B  C )
10. (d)
f ( A,B,C) = A  B C or A BC

8. (a)

f(A, B, C) = 1

Hence independent of A, B and C.

f ( w,x, y,z) = x z + w y + xz

Any issue with DPP, please report by clicking here:- https://forms.gle/t2SzQVvQcs638c4r5

For more questions, kindly visit the library section: Link for web: https://smart.link/sdfez8ejd80if

PW Mobile APP: https://smart.link/7wwosivoicgd4