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
ABCD0001111000011110

Click the cell of the 4-variable Karnaugh map that belongs to minterm m13 (variables A, B, C, D with A the most significant bit).

m13
  1. 1AB = 00, CD = 00
  2. 2AB = 00, CD = 01
  3. 3AB = 00, CD = 11
  4. 4AB = 00, CD = 10
  5. 5AB = 01, CD = 00
  6. 6AB = 01, CD = 01
  7. 7AB = 01, CD = 11
  8. 8AB = 01, CD = 10
  9. 9AB = 11, CD = 00
  10. 10AB = 11, CD = 01
  11. 11AB = 11, CD = 11
  12. 12AB = 11, CD = 10
  13. 13AB = 10, CD = 00
  14. 14AB = 10, CD = 01
  15. 15AB = 10, CD = 11
  16. 16AB = 10, CD = 10
2.Easy
ABCN1N2G1G2G3F

For the logic circuit shown, how many of the 8 combinations of the inputs A, B and C give the output F = 1? Find N.

A, B, C → F
N =
3.Medium
ABCD000111100001111010110302141507060121130151140819011110

Use the Karnaugh map to find the minimal sum-of-products (SOP) form of F(A, B, C, D) = Σm(0, 1, 4, 5, 9, 10, 13, 14). How many product terms N does it have?

F(A, B, C, D) = Σm(0, 1, 4, 5, 9, 10, 13, 14)
N =
4.Medium
MUX1I0​0I1​0I2​0I3​ABS1​S0​F

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₃ = 0. For how many of the 8 combinations of A, B and C is the output F = 1? Find N.

I₀ = 1I₁ = 0I₂ = 0I₃ = 0
N =
5.Hard
DQ3​Q3​DQ2​Q2​DQ1​Q1​DQ0​Q0​CLKJOHNSON

A 4-bit Johnson counter Q₃Q₂Q₁Q₀ starts at 0000. At every clock edge the bits shift one place to the right (Q₃ → Q₂ → Q₁ → Q₀) and Q₃ receives the inverse of Q₀. Give the state Q = Q₃Q₂Q₁Q₀ as a decimal number after 4 clock edges.

Q₃Q₂Q₁Q₀ = 00004
Q =
6.Hard
ABCD000111100001111000010312X4151716X12113X150141809X11110

Find the minimal SOP form of F(A, B, C, D) = Σm(2, 5, 6, 7, 8, 10, 13) + d(4, 11, 12, 15), where d marks the don't-care conditions. How many product terms N does it have?

F(A, B, C, D) = Σm(2, 5, 6, 7, 8, 10, 13) + d(4, 11, 12, 15)
N =

Answer key

  1. 1. AB = 11, CD = 01
  2. 2. N = 4
  3. 3. N = 3
  4. 4. N = 2
  5. 5. Q = 15
  6. 6. N = 3

Full step-by-step solutions: practise this topic on examproblems.com.