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
The function F = ((B + C)′·(A′ ⊕ C))′ is 0 for exactly one combination of the inputs. Click that row of the truth table.
- 1ABC = 000
- 2ABC = 001
- 3ABC = 010
- 4ABC = 011
- 5ABC = 100
- 6ABC = 101
- 7ABC = 110
- 8ABC = 111
Use the Karnaugh map to find the minimal sum-of-products (SOP) form of F(A, B, C, D) = Σm(0, 6, 7, 9, 13, 15). How many product terms N does it have?
Simplify F = A′BC + AB′C′ + A′B′C + BC to its minimal sum-of-products form. How many literals L does the simplified expression contain?
A 4-bit ring counter Q₃Q₂Q₁Q₀ starts at 1100. At every clock edge the bits shift one place to the right (Q₃ → Q₂ → Q₁ → Q₀) and Q₃ receives Q₀. Give the state Q = Q₃Q₂Q₁Q₀ as a decimal number after 11 clock edges.
A mod-7 counter is built from the minimum number of flip-flops. How many of the possible states U are never used?
Answer key
- 1. N = 1
- 2. ABC = 000
- 3. N = 4
- 4. L = 7
- 5. Q = 9
- 6. U = 1
Full step-by-step solutions: practise this topic on examproblems.com.