Skip to content

Course home

Representing algorithms

Representing algorithms

EasyMediumHard
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091
Question 88

Select one option to show which of the following is the false statement about the algorithm in Figure 1.

Figure 1

1  readings ← [14.2, 15.1, 14.9, 16.5, 17.0]
2  threshold ← 15.0
3  alertCount ← 0
4  FOR k ← 0 TO 4
5      curr ← readings[k]
6      WHILE curr > threshold AND alertCount < 3
7          alertCount ← alertCount + 1
8          curr ← curr - 1.0
9      ENDWHILE
10 ENDFOR
A

The algorithm uses nested iteration.

B

The algorithm uses selection.

C

The algorithm uses both definite and indefinite iteration.

D

The algorithm uses relational and logical operators.

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