Digital logic: gates, K-maps & flip-flops worksheet with answers
Free printable Digital logic: gates, K-maps & flip-flops worksheet: 6 problems from easy to exam level, with an answer key. Print it or save it as a PDF.
For teachers: free to print, copy and use in class. Every new worksheet has new values and its own answer key. A link to ExamProblems on your course page is appreciated.
Name: ____________________ Date: ____________
1.Easy
Click the cell of the 4-variable Karnaugh map that belongs to minterm m11 (variables A, B, C, D with A the most significant bit).
m11
1AB = 00, CD = 00
2AB = 00, CD = 01
3AB = 00, CD = 11
4AB = 00, CD = 10
5AB = 01, CD = 00
6AB = 01, CD = 01
7AB = 01, CD = 11
8AB = 01, CD = 10
9AB = 11, CD = 00
10AB = 11, CD = 01
11AB = 11, CD = 11
12AB = 11, CD = 10
13AB = 10, CD = 00
14AB = 10, CD = 01
15AB = 10, CD = 11
16AB = 10, CD = 10
2.Easy
The function F = (A′·B)′ + (A′·C′) is 0 for exactly one combination of the inputs. Click that row of the truth table.
F = (A′·B)′ + (A′·C′)
1ABC = 000
2ABC = 001
3ABC = 010
4ABC = 011
5ABC = 100
6ABC = 101
7ABC = 110
8ABC = 111
3.Medium
A 4-to-1 multiplexer has its select inputs S₁ = A and S₀ = B, and its data inputs tied to I₀ = 1, I₁ = 0, I₂ = 0, I₃ = 1. For how many of the 8 combinations of A, B and C is the output F = 1? Find N.
I₀ = 1I₁ = 0I₂ = 0I₃ = 1
N =
4.Medium
Use the Karnaugh map to find the minimal sum-of-products (SOP) form of F(A, B, C, D) = Σm(2, 3, 4, 5, 8, 9, 10, 12, 14, 15). How many product terms N does it have?
Find the minimal SOP form of F(A, B, C, D) = Σm(2, 6, 7, 8, 11, 14, 15) + d(0, 9, 10, 13), where d marks the don't-care conditions. How many literals L does it contain?
Find the minimal SOP form of F(A, B, C, D) = Σm(1, 2, 5, 7, 13, 15) + d(0, 3, 6, 12, 14), where d marks the don't-care conditions. How many product terms N does it have?