UGC NET CS 2004 Dec-Paper-2
March 13, 2024Question 5152 – Finite-Automata
March 13, 2024Question 9549 – Sequential-Circuits
Consider the partial implementation of 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
Correct Answer: D
Question 9 Explanation:
Sequence given is
0 – 2 – 3 – 1 – 0
or
00 – 10 – 11 – 01 – 00
From the given sequence, we have state table as,
Now we have present state and next state, so we should use excitation table of T flip-flop,
From state table,
T2 = Q2⊙Q1 and T1 = Q2⊕Q1
X = T1 = Q2⊕Q1
0 – 2 – 3 – 1 – 0
or
00 – 10 – 11 – 01 – 00
From the given sequence, we have state table as,
Now we have present state and next state, so we should use excitation table of T flip-flop,
From state table,
T2 = Q2⊙Q1 and T1 = Q2⊕Q1
X = T1 = Q2⊕Q1
Q2c
Q2 + Q1
(Q1 + Q2)c
Q1 ⊕ Q2