The function F = (A′ + B′ + (B ⊕ C′))′ is 1 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
The function F = (A′ + B′ + (B ⊕ C′))′ is 1 for exactly one combination of the inputs. Click that row of the truth table.
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.
Use the Karnaugh map to find the minimal sum-of-products (SOP) form of F(A, B, C, D) = Σm(0, 3, 5, 6, 7, 8, 10, 11, 12, 14). How many literals L does it contain in total (a primed variable counts as one literal)?
A 4-to-1 multiplexer has its select inputs S₁ = A and S₀ = B, and its data inputs tied to I₀ = C′, I₁ = 1, I₂ = 1, I₃ = C. For how many of the 8 combinations of A, B and C is the output F = 1? Find N.
A positive-edge-triggered D flip-flop starts with Q = 0 and receives the inputs shown at 7 rising clock edges. How many times N does Q change state?
For F(A, B, C, D) = Σm(0, 3, 4, 6, 8, 9, 10, 12, 13, 15) + d(5, 11), where d marks the don't-care conditions, find the number N of essential prime implicants.
Full step-by-step solutions: practise this topic on examproblems.com.