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
✓ Correct Answer
The correct answer is —. This question tests the candidate's understanding of system software and methodologies within the Computer Sciencesyllabus. The examiner's mark scheme requires...
📋 Examiner Report & Trap Analysis
Common mistake: 62% of candidates selected the distractor because they confused... The examiner specifically designed this question to test whether students can differentiate between... To secure full marks, candidates must demonstrate...
Unlock the Examiner's Answer
Sign up for free to reveal the correct answer, the official mark scheme breakdown, and the examiner trap analysis for this question.
Sign Up Free to Unlock →Join thousands of Cambridge students already using Oracle Prep