- A ring counter is a circular shift register with only one flip-flop being set at any particular time; all others are cleared.
- A $k$ - bit ring counter circulates a single bit among the flip flops to provide $k$ distinguishable states.

The Gateway to Computer Science Excellence

+12 votes

Best answer

12 flip flops required.

In ring counter, n flip flops generate n states where in twisted ring counter n flip flops generate 2n states.

for more info

http://www.electronics-tutorials.ws/sequential/seq_6.html

In ring counter, n flip flops generate n states where in twisted ring counter n flip flops generate 2n states.

for more info

http://www.electronics-tutorials.ws/sequential/seq_6.html

0

*Answer should be* **6**.

There are two types of ring counters.

(i) S*traight ring counter -needs 12 flipflops (ii)T**wisted ring counter - needs 6 flipflops.*

**Minimum is 6.**

**Reference:https://en.wikipedia.org/wiki/Ring_counter**

0

they have said ring counter if they meant twisted ring they should have specified it. i think 12 is the answer

0

Then why they have used word **Minimum?.**

Just search in google about "types of Ring Counter". Also see this http://www.worldofcomputing.net/digital-electronics/ring-counters.html , http://ds.opdenbrouw.nl/digse1/ring_counters.pdf

What is the answer given by isro?

0

minimum was the part of question i think. like minimum memory required . there are 4 option . but giving option 6 made it ambiguous. i think u should demand for marks on both 12 and 6.

0

Answer is b) 12 flip-flops

The “MODULO” or “MODULUS” of a counter is the number of states the counter counts or sequences through before repeating itself and a ring counter can be made to output any modulo number.

A “mod-n” ring counter will require “n” number of flip-flops connected together to circulate a single data bit providing “n” different output states.

For example, a mod-8 ring counter requires eight flip-flops and a mod-16 ring counter would require sixteen flip-flops.

The “MODULO” or “MODULUS” of a counter is the number of states the counter counts or sequences through before repeating itself and a ring counter can be made to output any modulo number.

A “mod-n” ring counter will require “n” number of flip-flops connected together to circulate a single data bit providing “n” different output states.

For example, a mod-8 ring counter requires eight flip-flops and a mod-16 ring counter would require sixteen flip-flops.

0 votes

For any counter:-

- There are a certain number of Flip Flops from which it is built.
- There are a certain number of states that the counter can be in. Each state represents a unique value.

$n$ Flip Flops count $2^n$ different values.

Or you can say that $n$ Flip Flops result in $2^n$ states, and each state represents a distinguishable value.

$n$ Flip Flops count $2^n$ different values.

Or you can say that $n$ Flip Flops result in $2^n$ states, and each state represents a distinguishable value.

$n$ Flip Flops count $2n$ different values.

Or you can say that $n$ Flip Flops result in $2n$ states, and each state represents a distinguishable value.

$n$ Flip Flops count $n$ different values.

Or you can say that $n$ Flip Flops result in $n$ states, and each state represents a distinguishable value.

Now unless explicitly mentioned otherwise, a ring counter should be assumed as a straight ring counter, which leads us to **Option B**

- 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,324 answers

198,404 comments

105,169 users