786 views
1 votes
1 votes

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

1 Answer

Best answer
5 votes
5 votes

here the sequence of states is 00 -> 10 -> 11-> 01 -> 00

then write like this..present state then next state and what will be the correponding value of flip flop for the state transition and then and then k-map for it and derive values of T2 and T1

answer correct or wrong?

selected by

Related questions

2 votes
2 votes
2 answers
1
One asked May 3, 2016
3,918 views
1.$ [(p\to q)\wedge (q\to r)]\to (p\to r)$2. $[(p \vee q) \wedge (p \to r) \wedge (q \to r)] \to r$
2 votes
2 votes
0 answers
3
Sanjay Sharma asked Sep 5, 2018
4,206 views
In flip flops which of the following specifies the nextstate given the present state and inputs ?(A) Characteristic table B) Excitation table(C) Truth table D...
1 votes
1 votes
4 answers
4
sh!va asked Mar 10, 2017
542 views
The truth tableXYF000010101111 Represent the Boolean function(a) X(b) X - Y(c) X +Y(d) Y