Multiple choice

Consider the partial implementation fo a 2-bit counter using T flip flops following the sequence 0-2-3-1-0, as shown below

To complete the circuit, the input X should be

  1. Q2'

  2. Q2+ Q1
  3. (Q1 $\oplus$ Q2)'
  4. Q1 $\oplus$ Q2
Reveal answer Fill a bubble to check yourself
D Correct answer
Explanation

Counter counts the no. of signal inversion change of states. Sequence input is 0 − 2 − 3 − 1 − 0 Binary 00 − 10 − 11 − 01 − 00 to generate signals if we XOR gate then it outputs 1 if both are different. So output sequence would be. 0 − 1 − 0 − 1 − 0 & the sequence would be counted. So. X = Q1$\oplus$Q2

Keep practicing — related questions