ITPEC IP April 2026 Question 7

State 4 — calculate the remainder again after the first transition, using the newly reached state.

Start at state 1.

• •First execution: 1 × 11 = 11, and 11 mod 3 = 2. Remainder 2 means move two states clockwise: 1 → 2 → 3.
• •Second execution uses state 3: 3 × 11 = 33, and 33 mod 3 = 0. Remainder 0 means move one state clockwise: 3 → 4.

The final state is 4.

Answer (d)

Why not others:
- (a) incorrectly returns to the starting state
- (b) represents only the first of the two clockwise steps required by the first remainder
- (c) is the intermediate state after the procedure has run once, not twice

Key rule: In repeated state transitions, each iteration uses the state produced by the previous iteration; recompute the condition rather than repeating the first move.

AI-generated — may contain errors