Fundamentals of Digital Design (ENGR210)

Practice Problem - Karnaugh Maps - Debarshi Ghosh

June 23, 2025

1. A Karnaugh map (K-Map) is an abstract form of — diagram organized as a matrix

of squares.

(a) Venn Diagram

(b) Cycle Diagram
(c) Block Diagram
(d) Triangular Diagram

2. Each product term of a group w’.x.y’ and w.y, represents the – in that group.

(a) Input
(b) POS
(c) Sum of Minterms
(d) Sum of Maxterms

3. The prime implicant which has at least one element that is not present in any other
implicant is known as—-

(a) Essential prime implicant

(b) Implicant
(c) Complement
(d) Prime Complement

4. Product-Of-Sum expressions can be implemented using—

(a) 2-level OR-AND logic circuits

(b) 2-level NOR logic circuits
(c) 2-level XOR logic circuits
(d) Both 2-level OR-AND and NOR logic circuits

5. Don’t care conditions can be used for simplifying Boolean expressions in –

(a) Registers
Fundamentals of Digital Design ENGR210

(b) Terms
(c) K-maps
(d) Latches

6. Out of the following steps, the proper sequence for simplifying a Boolean function
using a Karnaugh map (K-map):

(a) Identify and group the largest possible cluster of 1’s or in some cases, the
possible cluster consisting of 1’s and don’t care (X’s).
(b) Draw the K-map for the given boolean function.
(c) Write the simplified Boolean expression from the grouped clusters.
(d) Transfer the truth table values to the K-map

Choose the correct answer from the options given below:

1. (b), (d), (a), (c)

2. (d), (b), (a), (c)
3. (b), (a), (d), (c)
4. (a), (b), (c), (d)

7. The Boolean expression

P for the following would be:
F (A, B, C) = P (0, 2, 6) (These are representation of SOP expression)
d (A, B, C) = (1, 3, 5) (These are don’t care terms)

(a) A’C’ + BC’

(b) B + AC’
(c) A + BC’
(d) A’ + BC’
P
8. Simplified expression/s for following Boolean function F (A, B, C, D) = (0, 1, 2, 3, 6, 12, 13, 14, 15)
is/are:

(a) A’B’ + AB + A’C’D’

(b) A’B’+ AB + A’CD’
(c) A’B’ + AB + BC’D’
(d) A’B’ + AB + BCD’

1. (a) only
2. (b) only
3. (a) and (b) only

Page 2
Fundamentals of Digital Design ENGR210

4. (b) and (d) only

P
9. For the given Boolean function F (x, y, z) = (0, 2, 4, 5, 6), the simplified output
will be-

(a) F = z + xy’
(b) F = z + x’y
(c) F = z’ + x’y
(d) F = z’ + xy’

10. What is the minimum number of 2-input NOR gates required to implement a 4-
variable function expressed in the sum of minterms as? (Assume that all inputs
and their complements are available)
X
F (x, y, z) = (0, 2, 5, 7, 8, 10, 13, 15)

11. A karnaugh map is nothing more than a special form of truth table, useful for
reducing logic functions into minimal Boolean expressions. Here is a truth table
for a specific four-input logic circuit. Using Karnaugh map find out the simplified
Boolean expression. (Table 1)

A B C D Out
0 0 0 0 0
0 0 1 1 1
0 0 1 0 0
0 0 1 1 0
0 1 0 0 0
0 1 0 1 1
0 1 1 0 0
0 1 1 1 0
1 0 0 0 0
1 0 0 1 1
1 0 1 0 1
1 0 1 1 1
1 1 0 0 0
1 1 0 1 1
1 1 1 0 0
1 1 1 1 1

Table 1: Truth Table

Page 3
Fundamentals of Digital Design ENGR210

12. Simplify the following the boolean expression (minterms) using Karnaugh map
method:

(a) F = A’B’CD + AB’CD’ + ABCD’ + A’BC’D + AB’C’D’ + A’BCD’ +

ABC’D’ + A’BC’D’
(b) F = A’BC’D + AB’CD’ + ABCD’ + A’BC’D’ + AB’CD + A’BCD’ + ABC’D’
+ A’BCD
(c) F = A’BCD’ + AB’CD’ + A’BC’D + A’BCD + ABC’D’ + AB’CD + ABCD’
+ A’BC’D’
(d) F = ABCD’ + A’BCD’ + AB’CD + ABC’D’ + A’BC’D + A’BCD + AB’C’D’
+ ABCD
(e) F = AB’CD’ + ABCD’ + A’BCD + ABCD + A’BC’D + AB’CD + A’BCD’
+ A’BC’D
(f) F = A’BCD’ + AB’CD’ + A’BC’D + ABCD + AB’CD + A’BCD + ABC’D’
+ A’BC’D

13. Simplify the sum of products (SOP) boolean expressions using karnaugh map
method:
P
(a) F (A, B, C) = (0, 1, 2, 4, 6)
P
(b) F (A, B, C) = (0, 2, 3, 4, 6)
P
(c) F (A, B, C) = (1, 2, 4, 5, 7)
P
(d) F (A, B, C) = (1, 2, 4, 5, 6)
P
(e) F (A, B, C) = (1, 2, 3, 5, 6, 7)
P
(f) F (A, B, C, D) = (1, 2, 3, 5, 7, 11, 15)
P
(g) F (A, B, C, D) = (1, 2, 3, 5, 6, 8, 9, 12)
P
(h) F (A, B, C, D) = (0, 1, 4, 5, 6, 8, 9, 10)
P
(i) F (A, B, C, D) = (0, 1, 6, 7, 10, 11, 14, 15)

14. Simplify the sum of products (SOP) boolean expressions using Karnaugh map
method with the inclusion of don’t care conditions:
P
(a) F (A, B, C) = (0, 1, 2, 5, d4)
P
(b) F (A, B, C) = (0, 1, 2, d4, d5)
P
(c) F (A, B, C) = (0, 2, 4, 6, d1, d3)
P
(d) F (A, B, C) = (0, 2, 4, 6, 7, d1, d3)
P
(e) F (A, B, C, D) = (0, 2, 5, 7, d12, d14)
P
(f) F (A, B, C, D) = (0, 1, 5, 7, d8, d9, d11, d15)

Page 4
Fundamentals of Digital Design ENGR210

P
(g) F (A, B, C, D) = (0, 1, 2, 5, 8, d13, d14, d15)

15. Simplify the Boolean expression for the given truth table using Karnaugh map
simplification method. (Table 2)

A B C D Out
0 0 0 0 0
0 0 0 1 0
0 0 1 0 0
0 0 1 1 0
0 1 0 0 0
0 1 0 1 1
0 1 1 0 0
0 1 1 1 1
1 0 0 0 0
1 0 0 0 0
1 0 0 1 0
1 0 1 0 0
1 0 1 1 0
1 1 0 0 0
1 1 0 1 1
1 1 1 0 0
1 1 1 1 1

Table 2: Truth Table

Page 5