Complete the trace table for the algorithm shown in Figure 1.
You may not need to use all the rows in the table.
1 sectors ← ['ZoneA', 'ZoneB', 'ZoneC']
2 readings ← [15, 23, 8, 41, 12, 19, 34, 11, 27]
3 accum ← 0
4 FOR p ← 0 TO 2
5 loc ← sectors[p]
6 FOR q ← 0 TO 1
7 val ← readings[p * 3 + q]
8 accum ← accum + val
9 ENDFOR
10 ENDFOR
| accum | p | loc | q | val |
|---|---|---|---|---|
208 exam-style questions on AQA GCSE Computer Science Representing algorithms. Each one has a worked solution and a mark scheme showing where the marks go.