Register

GFG CSE Mock 2018 | Sequential Circuits

490 views
0 0 votes

Consider following counters:

Counter-1: 

Counter-2: 

Which of the following option is correct?

 

Counter-1 is a three-bit "counter" which counts $0, 1, 2, 4, 5, 7, 0, ... . $ and Counter-2 is a three-bit "counter" which counts $0, 3, 6, 1, 4, 7, 2, 5, 0, 3, ... .$
 

Counter-1 is a three-bit "counter" which counts $0, 2, 6, 1, 4, 7, 2, 5, 0, 2, ... .$ and Counter-2 is a three-bit "counter" which counts $0, 1, 2, 4, 5, 7, 0, ...$ .
 

Counter-1 is a three-bit "counter" which counts $0, 3, 6, 1, 4, 7, 2, 5, 0, 3, ...$ . and Counter-2 is a three-bit "counter" which counts $0, 1, 2, 4, 5, 7, 0, ...$ .
 

Counter-1 is a three-bit "counter" which counts $0, 3, 6, 1, 4, 7, 2, 5, 0, 3, ...$ . and Counter-2 is a three-bit "counter" which counts $0, 1, 2, 3, 5, 6, 0, ... $.

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · Made Easy Test Serie...Next → · GATE CS Mock 2018 | ...
← Previous in category · Digital Logic | Samp...Next in category → · GATE CS Mock 2018 | ...
Position:
Show:

Related questions

0 0 votes
0 0 answers
1.3k
1.3k views
Harsh Kumar asked Sep 16, 2018
1,322 views
Sequential Circuits - No of flip flops required
If there are total 16 different states in a system and there is one external input, then how many flip flops are required? Is it 3 or 4 ?Thank you.
0 0 votes
1 1 answer
566
566 views
rajveer43 asked Jan 12, 2024
566 views
GATE CS Mock 2018 | Question 60 | GFG
Consider the following statements regarding counters:S1 : The Hamming distance of an Overbeck counter is $1$. and the Hamming distance of a Johnson counter is $2$.S2 : On...
0 0 votes
1 1 answer
5.9k
5.9k views
garvit_vijai asked Nov 3, 2018
5,948 views
Sequential Circuits - Counters
A mod-2 counter followed by a mod-5 counter isa) Same as mod-5 counter followed by mod-2 counterb) A decade counterc) A mod-7 counterd) None
9 9 votes
3 3 answers
2.0k
2.0k views
gatecse asked Feb 23
1,969 views
GATE CSE 2026 | Set 1 | Question: 27
Consider a $2$-bit saturating up/down counter that performs the saturating up count when the input $P$ is $0$, and the saturating down count when $P$ is $1$. The Next Sta...