search
Log In
0 votes
323 views
How many illegitimate states does synchronous mod-6 counter have?
1) 3

2) 2

3) 1

4) 0
in Digital Logic
edited by
323 views
0
how we defined the illegitimate states ??

I heard this term ist time

can anyone explain me properly :3
0
What I felt after reading that word was the states which doesn't participate in counting loop are considered as illegitimate states.

Its my assumption
0

Hemanth_13

yes ...but answer given is 3 ..my doubt is how 3 states are illegitimate states here 

if we need mod 6 counter

we need 3 flip flips [if we use Johnson counter]

therefore total 8 states we have (0 to 7)

In which states are required to make 6 mod counter

remaining 2 are left

therefore answer should be 2 right

but I search in the Google ....and find correct answer is  3

if you find any solution for this  or know how to solve this question

let me know ok ???

1

Magma 

Yes what you said was right in case of Johnson counter if we have n states we get mod 2n counter, so we have two illegitimate states.

But we can use ring counter as well where we get mod n counter. Its huge taking to check with 6 bits 2^6=64 combinations

I tried with 4 bits and i got 3 illegitimate states.

0

Hemanth_13  thanks !!

you give the example of mod 4

for mod 6 also it gives 3 illegitimate states

therefore  it means In mod n counter  using ring counter where n >= 3 and  n is any arbitrary number  gives 3  illegitimate states ??

0
But how to know which counter to consider?Its just said synchronous counter..
0
Hmm point !

but if it's given that it's a synchronous counter (ring counter) ..and mod n (n>=3) then it always gives 3 illegitimate states
0

Magma 

For n=3 we only get 2. Plz check once

0
hmmm 2 :/
0
Multiple Sources are saying are different answers.

When I googled this question, answer was mentioned as 3 in 1 website, 1 in another website, 0 in another website. Now here in this website, you guys are saying 2 :\

Please log in or register to answer this question.

Related questions

0 votes
0 answers
1
264 views
An array has 5 elements. Calculate the following: SL. NO: NAME ARRAY IS ALREADY SORTED ARRAY IS REVERSE SORTED ELEMENT COMPARSIONS ELEMENT EXCHANGES ELEMENT COMPARISONS ELEMENT EXCHANGES 1 BUBBLE SORT ? ? ? ? 2 SELECTION SORT ? ? ? ? 3 INSERTION SORT ? ? ? ? 4 QUICK SORT ? ? ? ? 5 MERGE SORT ? ? ? ? 6 RADIX SORT ? ? ? ? 7 HEAP SORT ? ? ? ? 8 TREE SORT ? ? ? ? 9 COUNTING SORT ? ? ? ?
asked Oct 24, 2018 in Algorithms Balaji Jegan 264 views
0 votes
2 answers
2
222 views
A man alternately tosses a coin and throws a dice, beginning with the coin. Then probability that he will get a head before he gets a 5 or 6 on dice is 1) 1/4 2) 3/4 3) 4/5 4) 4/7
asked Oct 24, 2018 in Probability Balaji Jegan 222 views
0 votes
1 answer
3
65 views
If mean = (3 median – mode)x, then value of x is 1) 1 2) 2 3) 1/2 4) 3/2
asked Oct 24, 2018 in Probability Balaji Jegan 65 views
0 votes
0 answers
4
282 views
Minimum Hamming distance method is used for correction of 1) syntactic errors 2) semantic errors 3) algorithmic errors 4) transcription errors
asked Oct 24, 2018 in Computer Networks Balaji Jegan 282 views
...