I heard this term ist time

can anyone explain me properly :3

The Gateway to Computer Science Excellence

0 votes

0

how we defined the illegitimate states ??

I heard this term ist time

can anyone explain me properly :3

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

Its my assumption

0

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

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 ??

- All categories
- General Aptitude 1.9k
- Engineering Mathematics 7.5k
- Digital Logic 2.9k
- Programming and DS 4.9k
- Algorithms 4.3k
- Theory of Computation 6.2k
- Compiler Design 2.1k
- Databases 4.1k
- CO and Architecture 3.4k
- Computer Networks 4.1k
- Non GATE 1.5k
- Others 1.5k
- Admissions 595
- Exam Queries 576
- Tier 1 Placement Questions 23
- Job Queries 72
- Projects 17

50,648 questions

56,429 answers

195,216 comments

99,943 users