Digital Electronics - Counters - Discussion
Discussion Forum : Counters - General Questions (Q.No. 2)
2.
Using four cascaded counters with a total of 16 bits, how many states must be deleted to achieve a modulus of 50,000?
Discussion:
8 comments Page 1 of 1.
Nico said:
7 years ago
16 bits means the total number of states is 2^16 = 65536,
65536 - 50000 = 15536,
15536 states have to deleted to reach a modulus of 50000.
65536 - 50000 = 15536,
15536 states have to deleted to reach a modulus of 50000.
(2)
Suri_493 said:
1 decade ago
(2)^16=65,536
hence 65,536-50,000=15,536 it is the correct answer
hence 65,536-50,000=15,536 it is the correct answer
Hari said:
1 decade ago
For 4 FFs we have 2^4 = 16 different states. Here used 4 cascaded counters each has 4 FFs. So the number of different states are 2^16 = 65536
To achieve modulus of 50000 , the number of states deleted to be
65536 - 50000 = 15536
To achieve modulus of 50000 , the number of states deleted to be
65536 - 50000 = 15536
5G IIIT Basar said:
1 decade ago
2^4=16 FFs.
For 4 bit counter 4 FFs used.
For 4 cascaded 4 bit counter 4*4=16 FFs used.
So,
2^16=65536.
But we have 50000.
So,
65536-50000=15536.
For 4 bit counter 4 FFs used.
For 4 cascaded 4 bit counter 4*4=16 FFs used.
So,
2^16=65536.
But we have 50000.
So,
65536-50000=15536.
Rajeswari431 said:
1 decade ago
Given 16 bit counter.
FOUR cascaded 4 bit counter 4*4 = 16.
2^n = 2^16 = 65536.
But the given modulus = 50000.
So we require modulus = 65536-50000.
= 15536.
FOUR cascaded 4 bit counter 4*4 = 16.
2^n = 2^16 = 65536.
But the given modulus = 50000.
So we require modulus = 65536-50000.
= 15536.
Vijayalaxmi A said:
1 decade ago
Each cascaded counter having 4 Flip Flops.
For four flip flops means 4-bit counter, for 4-bit counter possible states are 16.
2^4 = 16.
For four cascaded counter no.of bits are 4*4=16.
So, the possible states are 2^16 = 65536.
For achieving 50000 states, 15536 must be deleted.
65536-50000 = 15536.
For four flip flops means 4-bit counter, for 4-bit counter possible states are 16.
2^4 = 16.
For four cascaded counter no.of bits are 4*4=16.
So, the possible states are 2^16 = 65536.
For achieving 50000 states, 15536 must be deleted.
65536-50000 = 15536.
Sriharsha said:
8 years ago
(2^16)-50,000 = 15,536.
RISHI NIGAM said:
3 years ago
We are using four cascaded counters means 16 bits it's given so 2^16-50000 will be answer because 16 bits is given we can find the total count by 2^16 these can be the total count which can be formed by 16 combinations and it is saying useful are 50000 so unused is 65536-50000.
Post your comments here:
Quick links
Quantitative Aptitude
Verbal (English)
Reasoning
Programming
Interview
Placement Papers