GATE 2008-IT
January 9, 2024GATE 1995
January 9, 2024UGC NET CS 2015 June Paper-3
| Question 6 |
The number of flip-flops required to design a modulo – 272 counter is:
| 8 | |
| 9 | |
| 27 | |
| 11 |
Question 6 Explanation:
If we have “n” flip-flops then total number of combinations possible is 2 n .
So total number of states possible is 2 n i.e. MOD 2 n .
Here 2 n = 272
So n = log 2 272
n = 9
So total number of states possible is 2 n i.e. MOD 2 n .
Here 2 n = 272
So n = log 2 272
n = 9
Correct Answer: B
Question 6 Explanation:
If we have “n” flip-flops then total number of combinations possible is 2 n .
So total number of states possible is 2 n i.e. MOD 2 n .
Here 2 n = 272
So n = log 2 272
n = 9
So total number of states possible is 2 n i.e. MOD 2 n .
Here 2 n = 272
So n = log 2 272
n = 9