The function F = (A′ + C)′·(A·B) 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′ + C)′·(A·B) is 1 for exactly one combination of the inputs. Click that row of the truth table.
The inputs of the logic circuit are A = 0, B = 0 and C = 0. Exactly one of its gates has the output 0. Click that gate.
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₂ = C, I₃ = C. For how many of the 8 combinations of A, B and C is the output F = 1? Find N.
A 4-to-1 multiplexer has its select inputs S₁ = A and S₀ = B, and its data inputs tied to I₀ = C′, I₁ = 0, I₂ = C′, I₃ = 0. For how many of the 8 combinations of A, B and C is the output F = 1? Find N.
Find the minimal SOP form of F(A, B, C, D) = Σm(0, 1, 5, 7, 11, 14) + d(6, 10, 15), where d marks the don't-care conditions. How many product terms N does it have?
For F(A, B, C, D) = Σm(1, 8, 12, 15) + d(0, 3, 6, 10), 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.