Register

GATE Overflow Test Series | Mixed Subjects | Test 2 | Question: 20

112 views

1 Answer

Best answer
3 votes
3 votes
Mod-6 up counter counts from $0$ to $63.$ Here, the given values are $100101_b = 37_{10}$ and $101_2 = 5_{10}.$ So, the counter will need $63 - 37 = 26$ clock pulses to reach the maximum value, one more clock pulse to reset the counter and $5$ more clock pulses to get value $5.$ So, total number of clock pulses $ = 26+1+5 = 32.$
• selected by
User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
1 answer
1
gatecse asked Aug 30, 2020
184 views
GATE Overflow Test Series | Mixed Subjects | Test 2 | Question: 1
A switch-tail ring counter is made using a single $T$ flip flop. The resulting circuit is equivalent to: SR flip flop JK flip flop T flip flop None of the above
A switch-tail ring counter is made using a single $T$ flip flop. The resulting circuit is equivalent to:SR flip flopJK flip flopT flip flopNone of the above
User Avatar
1 votes
1 votes
1 answer
2
gatecse asked Aug 30, 2020
106 views
GATE Overflow Test Series | Mixed Subjects | Test 2 | Question: 21
Consider a 4 bit Johnson counter with an initial decimal value of $1$. The counting sequence of this counter is: $1, 3, 15, 14, 12, 8, 7, 0$ $1, 3, 5, 7, 9, 11, 13, 15$ $1, 0, 8, 12, 14, 15, 7, 3$ $1, 7, 3, 0, 8, 12, 14, 15$
Consider a 4 bit Johnson counter with an initial decimal value of $1$. The counting sequence of this counter is:$1, 3, 15, 14, 12, 8, 7, 0$$1, 3, 5, 7, 9, 11, 13, 15$$1, ...
User Avatar
3 votes
3 votes
2 answers
3
gatecse asked Aug 30, 2020
195 views
GATE Overflow Test Series | Mixed Subjects | Test 2 | Question: 14
In most cases, the product of two $n-bit$ two's-complement numbers requires fewer than $2n$ bits. In fact, there is only one case in which $2n$ bits are needed. For $n = 4,$ let this happen for the product of $p$ and $q.$ Then, $p \times q =$ _____
In most cases, the product of two $n-bit$ two's-complement numbers requiresfewer than $2n$ bits. In fact, there is only one case in which $2n$ bits are needed. For $n = 4...
User Avatar
4 votes
4 votes
2 answers
4
gatecse asked Aug 30, 2020
248 views
GATE Overflow Test Series | Mixed Subjects | Test 2 | Question: 15
There are $2^{2^3} = 256$ boolean functions of three variables. How many of these $3$-input Boolean functions depend on all three variables?
There are $2^{2^3} = 256$ boolean functions of three variables. How many of these $3$-input Boolean functions depend on all three variables?
User Avatar
Link Copied!