The propagation delay of every gate is written under it. Find the worst-case propagation delay tpd from the inputs to the output F.
Digital logic: gates, K-maps & flip-flops worksheet with answers
Click the cell of the 4-variable Karnaugh map that belongs to minterm m15 (variables A, B, C, D with A the most significant bit).
- 1AB = 00, CD = 00
- 2AB = 00, CD = 01
- 3AB = 00, CD = 11
- 4AB = 00, CD = 10
- 5AB = 01, CD = 00
- 6AB = 01, CD = 01
- 7AB = 01, CD = 11
- 8AB = 01, CD = 10
- 9AB = 11, CD = 00
- 10AB = 11, CD = 01
- 11AB = 11, CD = 11
- 12AB = 11, CD = 10
- 13AB = 10, CD = 00
- 14AB = 10, CD = 01
- 15AB = 10, CD = 11
- 16AB = 10, CD = 10
In this Karnaugh map exactly one 1 has no neighbouring 1, so it stays a group of one cell (a full minterm of four literals) in the minimal SOP form. Neighbours across the map edges count. Click that cell.
- 1AB = 00, CD = 00
- 2AB = 00, CD = 01
- 3AB = 00, CD = 11
- 4AB = 00, CD = 10
- 5AB = 01, CD = 00
- 6AB = 01, CD = 01
- 7AB = 01, CD = 11
- 8AB = 01, CD = 10
- 9AB = 11, CD = 00
- 10AB = 11, CD = 01
- 11AB = 11, CD = 11
- 12AB = 11, CD = 10
- 13AB = 10, CD = 00
- 14AB = 10, CD = 01
- 15AB = 10, CD = 11
- 16AB = 10, CD = 10
Simplify F = B′C + A′C′ + A′BC′ + A′B′ to its minimal sum-of-products form. How many literals L does the simplified expression contain?
A Johnson (twisted-ring) counter is made of 3 D flip-flops, with the inverted last output fed back to the first input, and starts at all zeros. How many different states N does it go through?
Find the minimal SOP form of F(A, B, C, D) = Σm(2, 3, 4, 10, 12, 14) + d(11, 15), where d marks the don't-care conditions. How many product terms N does it have?
Answer key
- 1. tpd = 13 ns
- 2. AB = 11, CD = 11
- 3. AB = 10, CD = 10
- 4. L = 4
- 5. N = 6
- 6. N = 3
Full step-by-step solutions: practise this topic on examproblems.com.