Computer Science (AS & A Level) · Oct / Nov 2023 · Paper 21 · Question 7

An algorithm is represented by a state-transition diagram. The table shows the inputs, outputs and states for the algorithm: Current state Input Output Next state S1 A1 X1 S2 S2 A3 none S1 S2 A2 X4 S5 S5 A1 X1 S5 S5 A4 X2 S2 S5 A3 none S3 S1 A9 X9 S3 S3 A9 X9 S4 Complete the state-transition diagram to represent the information given in the table. S1 START A1 | X1 A3 [5]

Read automatically from the paper; the printed page above is exact.