- Computer Science Engineering (CSE)
- Digital Electronics and Logic Design
- 5-BIT JOHNSON COUNTER SEQUENCES THROUGH ...

Q. |
## 5-BIT JOHNSON COUNTER SEQUENCES THROUGH STATES |

A. | 7 |

B. | 10 |

C. | 32 |

D. | 25 |

Answer» B. 10 |

View all MCQs in:
Digital Electronics and Logic Design

- Consider an up/down counter that counts between 0 and 15, if external input(X) is “0” the counter counts upward (0000 to 1111) and if external input (X) is “1” the counter counts downward (1111 to 0000), now suppose that the present state is “1100” and X=1, the next state of the counter will be
- The sequence of states that are implemented by a n-bit Johnson counter is
- The sequence of states that are implemented by a n-bit Johnson counter is
- A mod-2 counter followed by a mod-5 counter is
- With the use of an electronic counter six capsules are to be filled in bottles automatically. In such a counter what will be the number of flip- flops required ?
- How many illegitimate states has synchronous mod-6 counter ?
- 2: The number of flip-flops required in a modulo N counter is
- 4: How many gates (minimum) are needed for a 3-bit up-counter using standard binary and using T lip-lops ? Assume unlimited fan-in.
- What is the maximum counting speed of a 4-bit binary counter which is composed of flip-flops with a propagation delay of 25 ns ?
- The ring counter is analogous to

Login to Continue

It will take less than 2 minutes

Report MCQ