Complete the trace table for the algorithm shown below.
You may not need to use all the rows in the table.
1 cities ← ['London', 'Paris', 'Rome']
2 temps ← [12, 15, -1, 18, 22, -1, 26, 30, -1]
3 count ← 0
4 FOR i ← 0 TO 2
5 city ← cities[i]
6 OUTPUT 'City: ', city
7 FOR j ← 0 TO 1
8 OUTPUT j + 1
9 temp ← temps[i * 3 + j]
10 OUTPUT temp
11 count ← count + 1
12 ENDFOR
13 ENDFOR
| count | i | city | j | temp |
|---|---|---|---|---|
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.