binary modulo n counter means Asynchronous mod n up/down counter.

The Gateway to Computer Science Excellence

First time here? Checkout the FAQ!

x

+13 votes

+21 votes

Best answer

+4

I have a doubt: if it is possible to form mod 8 counter using 3 FF. Why do we use Ring Counter or Johnson counter?

0

Counter | Flip flops | Counting |

Ring | N | mod(N) |

Johnson | N | mod(2N) |

Asynchronous | N | mod(2^N) |

I think here type of counter should be explicitly mentioned to find number of flip flops. @Shaik Masthan

- All categories
- General Aptitude 1.5k
- Engineering Mathematics 6.9k
- Digital Logic 2.7k
- Programming & DS 4.8k
- Algorithms 4.1k
- Theory of Computation 5.2k
- Compiler Design 2k
- Databases 3.9k
- CO & Architecture 3.4k
- Computer Networks 3.9k
- Non GATE 1.4k
- Others 1.5k
- Admissions 516
- Exam Queries 525
- Tier 1 Placement Questions 23
- Job Queries 67
- Projects 18

46,966 questions

51,292 answers

177,263 comments

66,643 users