0% found this document useful (0 votes)
26 views7 pages

K MAP Ex

The document presents a series of problems focused on minimizing boolean functions using Karnaugh maps (K Maps). Each problem includes a boolean function expressed in sum of minterms and provides a step-by-step solution to derive the minimized expression. The document emphasizes the importance of grouping in K Maps and highlights specific cases where certain groups may not be necessary.

Uploaded by

datalogdigital
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
26 views7 pages

K MAP Ex

The document presents a series of problems focused on minimizing boolean functions using Karnaugh maps (K Maps). Each problem includes a boolean function expressed in sum of minterms and provides a step-by-step solution to derive the minimized expression. The document emphasizes the importance of grouping in K Maps and highlights specific cases where certain groups may not be necessary.

Uploaded by

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

PROBLEMS BASED ON KARNAUGH MAP-(SOP)

Problem-01:
Minimize the following boolean function-

F(A, B, C, D) = Σm(0, 1, 2, 5, 7, 8, 9, 10, 13, 15)

Solution-
 Since the given boolean expression has 4 variables, so we draw a 4 x 4 K Map.
 We fill the cells of K Map in accordance with the given boolean function.
 Then, we form the groups in accordance with the above rules.

Then, we have-

Now,

F(A, B, C, D)

= (A’B + AB)(C’D + CD) + (A’B’ + A’B + AB + AB’)C’D + (A’B’ + AB’)(C’D’ + CD’)

= BD + C’D + B’D’

Thus, minimized boolean expression is-

F(A, B, C, D) = BD + C’D + B’D’

Problem-02:

Minimize the following boolean function

F(A, B, C, D) = Σm(0, 1, 3, 5, 7, 8, 9, 11, 13, 15)-

Solution-
 Since the given boolean expression has 4 variables, so we draw a 4 x 4 K Map.
 We fill the cells of K Map in accordance with the given boolean function.
 Then, we form the groups in accordance with the above rules.

Then, we have-

1
Now,
F(A, B, C, D)
= (A’B’ + A’B + AB + AB’)(C’D + CD) + (A’B’ + AB’)(C’D’ + C’D)
= D + B’C’
 Thus, minimized boolean expression is-Since the given boolean expression has 3 variables, so we draw a 2 x
4 K Map.
 We fill the cells of K Map in accordance with the given boolean function.
 Then, we form the groups in accordance with the above rules.

F(A, B, C, D) = B’C’ + D

Problem-03:

Minimize the following boolean function-

F(A, B, C, D) = Σm(1, 3, 4, 6, 8, 9, 11, 13, 15) + Σd(0, 2, 14)

Solution-

 Since the given boolean expression has 4 variables, so we draw a 4 x 4 K Map.


 We fill the cells of K Map in accordance with the given boolean function.
 Then, we form the groups in accordance with the above rules.

Then, we have-

2
Now,
F(A, B, C, D)
= (AB + AB’)(C’D + CD) + (A’B’ + AB’)(C’D + CD) + (A’B’ + AB’)(C’D’ + C’D) + (A’B’ + A’B)(C’D’ + CD’)
= AD + B’D + B’C’ + A’D’
Thus, minimized boolean expression is-
F(A, B, C, D) = AD + B’D + B’C’ + A’D’

Problem-04:

Minimize the following boolean function-


F(A, B, C) = Σm(0, 1, 6, 7) + Σd(3, 5)

Solution-
 Since the given boolean expression has 3 variables, so we draw a 2 x 4 K Map.
 We fill the cells of K Map in accordance with the given boolean function.
 Then, we form the groups in accordance with the above rules.
Then, we have-

Now,
F(A, B, C)
= A'(B’C’ + B’C) + A(BC + BC’)
= A’B’ + AB

Thus, minimized boolean expression is-


F(A, B, C) = AB + A’B’

NOTE-
 It may be noted that there is no need of considering the quad group.
 This is because even if we consider that group, we will have to consider the other two duets.
 So, there is no use of considering that quad group.

3
Problem-05:
Minimize the following boolean function-

F(A, B, C) = Σm(1, 2, 5, 7) + Σd(0, 4, 6)

Solution-
 Since the given boolean expression has 3 variables, so we draw a 2 x 4 K Map.
 We fill the cells of K Map in accordance with the given boolean function.
 Then, we form the groups in accordance with the above rules.
Then, we have-

Now,
F(A, B, C)
= (A + A’)(B’C’ + B’C) + A(B’C’ + B’C + BC + BC’) + (A + A’)(B’C’ + BC’)
= B’ + A + C’

Thus, minimized boolean expression is-

F(A, B, C) = A + B’ + C’

Problem-06:
Minimize the following boolean function-
F(A, B, C) = Σm(0, 1, 6, 7) + Σd(3, 4, 5)

Solution-
 Since the given boolean expression has 3 variables, so we draw a 2 x 4 K Map.
 We fill the cells of K Map in accordance with the given boolean function.
 Then, we form the groups in accordance with the above rules.

Then, we have-

Now,

4
F(A, B, C)
= (A + A’)(B’C’ + B’C) + A(B’C’ + B’C + BC + BC’)
= B’ + A

Thus, minimized boolean expression is-


F(A, B, C) = A + B’

Problem-07:
Minimize the following boolean function-
F(A, B, C, D) = Σm(0, 2, 8, 10, 14) + Σd(5, 15)

Solution-

 Since the given boolean expression has 4 variables, so we draw a 4 x 4 K Map.


 We fill the cells of K Map in accordance with the given boolean function.
 Then, we form the groups in accordance with the above rules.

Then, we have-

Now,
F(A, B, C, D)
= (AB + AB’)CD’ + (A’B’ + AB’)(C’D’ + CD’)
= ACD’ + B’D’
Thus, minimized boolean expression is-
F(A, B, C, D) = ACD’ + B’D’

Problem-08:
Minimize the following boolean function-
F(A, B, C, D) = Σm(3, 4, 5, 7, 9, 13, 14, 15)

Solution-
 Since the given boolean expression has 4 variables, so we draw a 4 x 4 K Map.
 We fill the cells of K Map in accordance with the given boolean function.
 Then, we form the groups in accordance with the above rules.
Then, we have-

5
Now,
F(A, B, C, D)
= A’B(C’D’ + C’D) + (A’B’ + A’B)(CD) + (AB + AB’)(C’D) + AB(CD + CD’)
= A’BC’ + A’CD + AC’D + ABC
Thus, minimized boolean expression is-

F(A, B, C, D) = A’BC’ + A’CD + AC’D + ABC

It is important to note that we are not considering the quad group because we have to consider the duets
anyhow.

Problem-09:
Consider the following boolean function-

F(W, X, Y, Z) = Σm(1, 3, 4, 6, 9, 11, 12, 14)

This function is independent ________ number of variables. Fill in the blank.

Solution-
 Since the given boolean expression has 4 variables, so we draw a 4 x 4 K Map.
 We fill the cells of K Map in accordance with the given boolean function.
 Then, we form the groups in accordance with the above rules.
Then, we have-

Now,
F(W, X, Y, Z)

6
= (W’X + WX)(Y’Z’ + YZ’) + (W’X’ + WX’)(Y’Z + YZ)
= XZ’ + X’Z

=X⊕Z
Thus, minimized boolean expression is-

F(W, X, Y, Z) = X ⊕ Z
Clearly, the given boolean function depends on only two variables X and Z.
Hence, it is independent of other two variables W and Y.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy