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.

New worksheetPractise online with hints

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 = 0N1G1G2F

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. 2G1
  3. 3G2
2.Easy
A = 0B = 0C = 1G1G2G3F

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

A = 0B = 0C = 1
  1. 1G1
  2. 2G2
  3. 3G3
3.Medium
MUX1I0​C′I1​0I2​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₀ = 1, I₁ = C′, I₂ = 0, I₃ = C′. For how many of the 8 combinations of A, B and C is the output F = 1? Find N.

I₀ = 1I₁ = C′I₂ = 0I₃ = C′
N =
4.Medium
ABC000111100101324576

Simplify F = BC + AB + AC′ to its minimal sum-of-products form. How many literals L does the simplified expression contain?

F = BC + AB + AC′
L =
5.Hard
ABCD00011110000111100001131214X5X706012013X15X1418X9011110

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

F(A, B, C, D) = Σm(2, 3, 4, 8, 10) + d(5, 7, 9, 14, 15)
N =
6.Hard
ABCD0001111000011110X0110302X40517X61121130150141809X11X10

Find the minimal SOP form of F(A, B, C, D) = Σm(1, 7, 8, 12, 13) + d(0, 4, 6, 10, 11), where d marks the don't-care conditions. How many literals L does it contain?

F(A, B, C, D) = Σm(1, 7, 8, 12, 13) + d(0, 4, 6, 10, 11)
L =

Answer key

  1. 1. N1
  2. 2. G3
  3. 3. N = 4
  4. 4. L = 4
  5. 5. N = 3
  6. 6. L = 11

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