An environmental engineer is monitoring the daily water processing capacity across three treatment sectors. The following algorithm tracks the volume of water processed and determines the number of active filtration units needed in each sector.
Complete the trace table below for this algorithm.
Part of the table has already been filled in.
You may not need to use all the empty rows in the table.
inflow ← [17, 34, 11]
collected ← [14, 23, 19]
filters ← [0, 0, 0]
FOR k ← 0 TO 2
totalVolume ← inflow[k] + collected[k]
filters[k] ← totalVolume DIV 6
ENDFOR
totalFilters ← filters[0] + filters[1] + filters
OUTPUT totalFilters
| k | totalVolume | filters | totalFilters | ||
|---|---|---|---|---|---|
| [0] | [1] | [2] | |||
| 0 | 0 | 0 | |||
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.