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. A1|X1 START S1 A3
- (a)Complete the state-transition diagram to represent the information given in the table.[5]
This question uses a diagram from the original paper, which isn't shown here. Open the full paper from the past papers archive to see it.
Mark scheme
Marking points from the official mark scheme (Oct/Nov 2023). The mark or mark type is shown in brackets.
- [1] S2 labelled (with a circle)
- [1] S3, S4, and S5 added (as circles)
- [1] Transition from S1 to S3: A9|X9
- [1] All three transitions between S2 and S5: S2 to S5 (A2|X4), S5 to S5 (A1|X1), S5 to S2 (A4|X2)
- [1] Transition from S5 to S3 (A3|none) AND from S3 to S4 (A9|X9)
Write your answer and get it marked
On Oracle Prep you can write or photograph your own answer and have it marked by AI against this mark scheme, with feedback on what you missed.
Sign up free →