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 NOR function shown?
Digital logic: gates, K-maps & flip-flops worksheet with answers
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 XNOR function shown?
Use the Karnaugh map to find the minimal product-of-sums (POS) form of F(A, B, C, D) = Σm(1, 2, 6, 9, 10, 11, 13). How many sum terms (factors) N does it have?
Use the Karnaugh map to find the minimal sum-of-products (SOP) form of F(A, B, C, D) = Σm(1, 2, 4, 5, 6, 7, 8, 10, 15). How many literals L does it contain in total (a primed variable counts as one literal)?
Find the minimal SOP form of F(A, B, C, D) = Σm(2, 3, 4, 11, 12, 15) + d(0, 1, 6), where d marks the don't-care conditions. How many product terms N does it have?
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
Answer key
- 1. N = 4
- 2. N = 5
- 3. N = 4
- 4. L = 14
- 5. N = 3
- 6. clock edge 4
Full step-by-step solutions: practise this topic on examproblems.com.