Skip to content

Course home

Representing algorithms

Representing algorithms

EasyMediumHard
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091
Question 3

Complete the trace table for the algorithm shown below.

You may not need to use all the rows in the table.

1  sensors ← ['Zone A', 'Zone B', 'Zone C']
2  data ← [1.5, 2.0, -9.9, 3.5, 4.0, -9.9, 5.5, 6.0, -9.9]
3  total ← 0.0
4  FOR i ← 0 TO 2
5      sensor ← sensors[i]
6      OUTPUT 'Sensor: ', sensor
7      FOR j ← 0 TO 1
8          OUTPUT j + 1
9          val ← data[i * 3 + j]
10         OUTPUT val
11         total ← total + val
12     ENDFOR
13 ENDFOR
totalisensorjval
[5]
Markscheme

Representing algorithms Questions

  1. GCSE
  2. /Computer Science
  3. /Representing algorithms

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.

Question bank