https://uadoc.uacdn.net/doubts/017A29QEVC/1635972110S6WT750N.JPEG

8
2min 35 sec
+2.0 -0.66
E A A
a
The FSM (finite state machine) whose transition
diagram is shown below has a three-bit output
R2R1 Ro which is initially 000.
(Given that remainder modulo x of arbitrary number
'n' means remainder after an arbitrary number is
divisible by x)
1
S
S.
001
0
011
S.
0
0
000
1
1
?
1
S.
0
SA
010
100
As successive bits of the number (input) are entered
from left to right, the output change to reflect which
one of the following operations?
1.
determines the remainder modulo 3 of
an arbitrary binary number
2.
determines the remainder modulo 5 of
an arbitrary binary number
$
3.
detects the input sequence 1110
4.
detects the input sequence 1000


English

Revised solution

Educator solution

GATE & ESE - EE, EC

GATE, ESE and IIT-JAM

Ace the toughest competitive and government exams in India 

Doubt solution

Doubt details

ECE

AUTO-GENERATED

Solutions available

Revised solution

Educator solution