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
A = 1B = 1C = 0N1G1N2G2F

The inputs of the logic circuit are A = 1, B = 1 and C = 0. Exactly one of its gates has the output 0. Click that gate.

A = 1B = 1C = 0
  1. 1N1
  2. 2N2
  3. 3G1
  4. 4G2
2.Easy
A = 1B = 1C = 1N1N2G1G2G3F

The inputs of the logic circuit are A = 1, B = 1 and C = 1. Exactly one of its gates has the output 1. Click that gate.

A = 1B = 1C = 1
  1. 1N1
  2. 2N2
  3. 3G1
  4. 4G2
  5. 5G3
3.Medium
ABCD000111100001111000110302040507060121131151140809011110

Use the Karnaugh map to find the minimal product-of-sums (POS) form of F(A, B, C, D) = Σm(1, 10, 13, 14, 15). How many sum terms (factors) N does it have?

F(A, B, C, D) = Σm(1, 10, 13, 14, 15)
N =
4.Medium
MUXCI0​C′I1​C′I2​C′I3​ABS1​S0​F

A 4-to-1 multiplexer has its select inputs S₁ = A and S₀ = B, and its data inputs tied to I₀ = C, I₁ = C′, I₂ = C′, I₃ = C′. For how many of the 8 combinations of A, B and C is the output F = 1? Find N.

I₀ = CI₁ = C′I₂ = C′I₃ = C′
N =
5.Hard
CLKJK123456

A positive-edge-triggered JK flip-flop starts with Q = 0 and receives the inputs shown. Click the first clock edge at which Q goes from 1 back to 0.

Q₀ = 0JK
  1. 1clock edge 1
  2. 2clock edge 2
  3. 3clock edge 3
  4. 4clock edge 4
  5. 5clock edge 5
  6. 6clock edge 6
6.Hard
ABCD00011110000111101001031214051716012113X15114X819111010

For F(A, B, C, D) = Σm(0, 2, 4, 6, 7, 9, 11, 13, 14) + d(8, 15), where d marks the don't-care conditions, find the number N of essential prime implicants.

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

Answer key

  1. 1. N1
  2. 2. G3
  3. 3. N = 4
  4. 4. N = 4
  5. 5. clock edge 5
  6. 6. N = 3

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