I think question is incomplete... its not given whether the counter is asynchronous or synchronus ?.. coz in both the cases answer will be different.

The Gateway to Computer Science Excellence

+13 votes

Best answer

0

I think question is incomplete... its not given whether the counter is asynchronous or synchronus ?.. coz in both the cases answer will be different.

0

but no of states depends ..

for n bit conuter

1.for synchronous , total no of states possible = n (Ring counter)

2. for synchronous , total no of states possible = n (Johnson counter)

3. for asynchronous , total no of states possible = 2 Power n

ur solution is possible only by assuming case 3rd

for n bit conuter

1.for synchronous , total no of states possible = n (Ring counter)

2. for synchronous , total no of states possible = n (Johnson counter)

3. for asynchronous , total no of states possible = 2 Power n

ur solution is possible only by assuming case 3rd

0

1. n-bit synchronous counter, no of states = 2^n

2. n-bit asynchronous counter, no of states = 2^n

3. Ring counter and Johnson counter are special counters.

2. n-bit asynchronous counter, no of states = 2^n

3. Ring counter and Johnson counter are special counters.

0

M getting confused here, i read that we can have mod N or mod 2N synchronous counter or mod 2^N asynchronous conuter using n bits.

- All categories
- General Aptitude 1.9k
- Engineering Mathematics 7.5k
- Digital Logic 2.9k
- Programming and DS 4.9k
- Algorithms 4.4k
- Theory of Computation 6.2k
- Compiler Design 2.1k
- Databases 4.1k
- CO and Architecture 3.4k
- Computer Networks 4.2k
- Non GATE 1.4k
- Others 1.4k
- Admissions 595
- Exam Queries 573
- Tier 1 Placement Questions 23
- Job Queries 72
- Projects 18

50,737 questions

57,353 answers

198,477 comments

105,248 users