Skip to content

Course home

Representing algorithms

Representing algorithms

EasyMediumHard
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091
Question 52

An ecologist uses the following algorithm to track the number of rare bird sightings on two different islands over several observation windows.

1  islands ← ['Skye', 'Arran']
2  sightings ← [6, 11, 4, 15, 9, 3, 12, 18]
3  count ← 0
4  FOR i ← 0 TO 1
5      island ← islands[i]
6      FOR j ← 0 TO 2
7          observed ← sightings[i * 4 + j]
8          count ← count + observed
9      ENDFOR
10 ENDFOR

Complete the trace table below for this algorithm. You may not need to use all the rows in the table.

countiislandjobserved
[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