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.
- 1N1
- 2G1
- 3G2
- 4G3
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.
The function F = (A ⊕ B) + A + C is 0 for exactly one combination of the inputs. Click that row of the truth table.
Use the Karnaugh map to find the minimal sum-of-products (SOP) form of F(A, B, C) = Σm(0, 1, 3, 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(0, 3, 8, 10, 12, 13). How many literals L does it contain in total (a primed variable counts as one literal)?
A 3-bit binary up counter starts at 1 (decimal, Q = 001). Which count Q (in decimal) does it show after 26 clock pulses?
A 3-bit binary up counter starts at 1 (decimal, Q = 001). Which count Q (in decimal) does it show after 12 clock pulses?
Full step-by-step solutions: practise this topic on examproblems.com.