Відео

No, dear. Ideally, 01 can never come before 10 in real-time applications. Kindly watch the complete video. I hope things will be clear.

Kindly watch the video at 5:00 to get a better idea of it.

Sir ... I think it does not matter a lot... Because we are assuming input 0 or 1 ... If assume begining input is 1 we will get different state... Usually while writing state table .. What i observed in all videos / what i heard from my lecture is they consider 00-S0, 01-S1, 10-S2 and 11-S3 or 00-a, 01-b, 10-C and 11-d.

This is not about the four combinations as the weighted code as 2^1 2^0 0 0 0 1 1 0 1 1 Here the discussion is about the shift registers. FF1 is the 1st flipflop and it feeds the 2nd flipflop designated as FF2. ∴ the sequences have to be proper. Though you can name the way as per wish. in FF1 FF2 State Comments 0 0 s0 Power on reset 0 0 0 s0 Already designated, hence no need to write the same again. 1 1 0 s1 First new state possible 1 0 s1 Inputs can be either 0 or 1. 0 0 1 s2 second new state possible. 1 1 1 s3 third new state possible. Only thing is s2 and s3 can be interchangeable as 1 0 s1 Inputs can be either 0 or 1. 1 1 1 s2 second new state possible. 0 0 1 s3 third new state possible. Beyond this all the states will among the above four states. Also 01 can never appear before 10, as these are shift register contents. But designating it as s1/s2 or b/c is immaterial. Hope this clears the confusion.

Happy for your results. Very nice to hear this. Congratulations and all the best.

Access it from this link drive.google.com/file/d/1qsmgh0wsw9r1tzjZ2DrVpDJrYgW19ntO/view?usp=sharing

@@harshabk3863 thankyou sir

Have two registers (pointers): One for taking the data from the array (number under test). Another one for saving the status(+ve or -ve). Have a counter to check if all the elements in the array have been parsed. Follow the process as mentioned in the Video until all the elements in the array have been tested.

Kiran you can find one such example numerical in this link sites.google.com/a/cmrit.ac.in/harsha_bk/information-theory-coding/notes/module-wise-class-notes

@@harshabk3863 sir in the provided link code tree is not visible sir