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 worksheet Practise 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

The propagation delay of every gate is written under it. Find the worst-case propagation delay t_pd from the inputs to the output F.

N1: 3 nsG1: 3 nsG2: 3 nsG3: 4 ns

t_pd = ns

2.Easy

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

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

F(A, B, C, D) = Σm(0, 2, 5, 9, 10, 13)

N =

4.Medium

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

F(A, B, C, D) = Σm(1, 3, 4, 5, 6, 9, 10, 14)

N =

5.Hard

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

F(A, B, C, D) = Σm(0, 2, 3, 4, 6, 8, 9) + d(5, 10, 11)

N =

6.Hard

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

F(A, B, C, D) = Σm(6, 8, 10, 11) + d(2, 5, 9, 15)

N =

Answer key

1. t_pd = 10 ns
2. N = 6
3. N = 4
4. N = 5
5. N = 3
6. N = 2

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