Register

GATE CSE 2015 Set 1 | Question: 20

• edited by
20,831 views
52 votes
52 votes

Consider a $4$-bit Johnson counter with an initial value of $0000.$ The counting sequence of this counter is 

  1. $0, 1, 3, 7, 15, 14, 12, 8, 0$
  2. $0, 1, 3, 5, 7, 9, 11, 13, 15, 0$
  3. $0, 2, 4, 6, 8, 10, 12, 14, 0$
  4. $0, 8, 12, 14, 15, 7, 3, 1, 0$
• edited by
User Avatar

7 Answers

4 votes
4 votes

Johnson counter /twisted ring counter :-

"N" bit then there will be "2N" states 

Option B easily eliminated as it has 9 state form rest we will have to check out.

Answer :- D 

 

User Avatar
0 votes
0 votes
  1. Structure: It consists of 4 flip-flops connected in a ring, with the inverted output of the last flip-flop feeding back to the input of the first flip-flop.
  2. Initial State: Starts with all flip-flops at $0 (0000)$.
  3. Counting:
    • With each clock pulse, the bits shift one position to the right.
    • The inverted output of the last flip-flop determines the new bit shifted into the first flip-flop.

Counting Sequence:

  1. $0000$ (initial state)
  2. $1000$ (inverted $0$ from last flip-flop shifts in)
  3. $1100$
  4. $1110$
  5. $1111$
  6. $0111$ (inverted $1$ from last flip-flop shifts in)
  7. $0011$
  8. $0001$
  9. $0000$ (repeats)
User Avatar
Page:
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

65 votes
65 votes
12 answers
1
makhdoom ghaya asked Feb 13, 2015
17,233 views
GATE CSE 2015 Set 1 | Question: 52
Consider the DFAs $M$ and $N$ given above. The number of states in a minimal DFA that accept the language $L(M) \cap L(N)$ is_____________.
Consider the DFAs $M$ and $N$ given above. The number of states in a minimal DFA that accept the language $L(M) \cap L(N)$ is_____________.
User Avatar
28 votes
28 votes
1 answer
3
makhdoom ghaya asked Feb 13, 2015
6,995 views
GATE CSE 2015 Set 1 | Question: 32
Consider a max heap, represented by the array: $40, 30, 20, 10, 15, 16, 17, 8, 4$ ... $40, 30, 20, 10, 35, 16, 17, 8, 4, 15$ $40, 35, 20, 10, 15, 16, 17, 8, 4, 30$
Consider a max heap, represented by the array: $40, 30, 20, 10, 15, 16, 17, 8, 4$.$$\begin{array}{|l|l|}\hline \text{Array index} & \text{1} & \text{2} & \text{3} & \...
User Avatar
25 votes
25 votes
2 answers
4
makhdoom ghaya asked Feb 13, 2015
6,438 views
GATE CSE 2015 Set 1 | Question: 28
The binary operator $\neq$ ... about the binary operator $\neq$ ? Both commutative and associative Commutative but not associative Not commutative but associative Neither commutative nor associative
The binary operator $\neq$ is defined by the following truth table.$$\begin{array}{|l|l|l|} \hline \textbf{p} & \textbf{q}& \textbf{p} \neq \textbf{q}\\\hline \text{0} & ...
User Avatar
Link Copied!