WorksheetsBoolean Algebra and K-map Worksheet
Total questions: 10
Worksheet time: 7mins
The number of essential prime implicant for the logic expression: F = ABC + CDA + BD + AC
2
4
3
5
BCD digits in a Karnaugh map are restricted from:
0000 through 1100
0000 through 1010
1010 through 1110
1010 through 1111
Boolean functions using Karnaugh maps?
You can only group adjacent 1s in powers of two
You cannot group 0s in the Karnaugh map
You can group 1s and 0s together
You need to group all the 1s in the map for a valid simplification
Which of the following is the simplified form of the given function. f(A, B, C) = Σm(0, 1, 3, 7)
A'B'C' + A'B'C + A'BC + ABC
A'B' + A'BC + ABC
A'B' + BC
A'B' + BC'
A combination circuit has inputs A, B and C, its K-map is given below. The output of circuit is given by
(ĀB + AB̅)C
(ĀB + AB̅)C̅
ĀB̅C
A⊕B⊕C
A boolean function is given as F(x, y, z) = Σ(1, 3, 6, 7). What is its equivalent canonical form?
F(x, y, z) = Π (0, 2, 3, 5) product of max terms
F(x, y, z) = Π (0, 2, 4, 5) product of max terms
F(x, y, z) = Π (0, 2, 4, 5) product of min terms
F(x, y, z) = Π (0, 2, 4, 5) sum of max terms
The minterm expansion of f (P, Q, R) = PQ + QR̅ + P̅R is
m₂ + m₄ + m₆ + m₇
m₀ + m₁ + m₆ + m₇
m₂ + m₃ + m₄ + m₅
m₀ + m₁ + m₃ + m₇
The Boolean equation X = [(A + B̅) (B + C)] B can be simplified to
X = A̅B
X = A̅B̅
X = AB
X = A̅ B̅
The output Y of the logic circuit given below is:-
1
0
X
X̅
Y=A+BC
Y=AC
Y=C+AB
Y=B+AC
