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.
Digital logic: gates, K-maps & flip-flops worksheet with answers
Click the cell of the 3-variable Karnaugh map that belongs to minterm m4 (variables A, B, C with A the most significant bit).
- 1A = 0, BC = 00
- 2A = 0, BC = 01
- 3A = 0, BC = 11
- 4A = 0, BC = 10
- 5A = 1, BC = 00
- 6A = 1, BC = 01
- 7A = 1, BC = 11
- 8A = 1, BC = 10
Use the Karnaugh map to find the minimal product-of-sums (POS) form of F(A, B, C, D) = Σm(0, 2, 9, 11, 13). How many sum terms (factors) N does it have?
Use the Karnaugh map to find the minimal product-of-sums (POS) form of F(A, B, C) = Σm(0, 1, 2). How many sum terms (factors) N does it have?
A positive-edge-triggered JK flip-flop starts with Q = 0 and receives the inputs shown at 6 rising clock edges. How many times N does Q change state?
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.
- 1clock edge 1
- 2clock edge 2
- 3clock edge 3
- 4clock edge 4
- 5clock edge 5
- 6clock edge 6
- 7clock edge 7
- 8clock edge 8
Answer key
- 1. N = 1
- 2. A = 1, BC = 00
- 3. N = 4
- 4. N = 2
- 5. N = 3
- 6. clock edge 6
Full step-by-step solutions: practise this topic on examproblems.com.