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 NOR gates needed to build the XOR function shown?
Digital logic: gates, K-maps & flip-flops worksheet with answers
Click the cell of the 4-variable Karnaugh map that belongs to minterm m1 (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
Use the Karnaugh map to find the minimal sum-of-products (SOP) form of F(A, B, C) = Σm(0, 3, 4, 6, 7). How many product terms N does it have?
Use the Karnaugh map to find the minimal sum-of-products (SOP) form of F(A, B, C, D) = Σm(3, 8, 11). How many literals L does it contain in total (a primed variable counts as one literal)?
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
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
Answer key
- 1. N = 5
- 2. AB = 00, CD = 01
- 3. N = 3
- 4. L = 7
- 5. clock edge 3
- 6. clock edge 5
Full step-by-step solutions: practise this topic on examproblems.com.