NAND and NOR are universal gates: any logic function can be built from one of them alone. What is the minimum number N of 2-input NAND gates needed to build the OR function shown?
Digital logic: gates, K-maps & flip-flops worksheet with answers
The propagation delay of every gate is written under it. Find the worst-case propagation delay tpd from the inputs to the output F.
Use the Karnaugh map to find the minimal sum-of-products (SOP) form of F(A, B, C, D) = Σm(0, 4, 6, 7, 13, 14). How many literals L does it contain in total (a primed variable counts as one literal)?
Use the Karnaugh map to find the minimal product-of-sums (POS) form of F(A, B, C, D) = Σm(2, 4, 5, 7, 10, 11, 12, 14). How many sum terms (factors) N does it have?
A mod-25 counter is built from the minimum number of flip-flops. How many of the possible states U are never used?
A positive-edge-triggered D 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 = 3
- 2. tpd = 9 ns
- 3. L = 13
- 4. N = 4
- 5. U = 7
- 6. clock edge 4
Full step-by-step solutions: practise this topic on examproblems.com.