Skip to content

Course home

Representing algorithms

Representing algorithms

EasyMediumHard
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108
Question 89

An algorithm is shown in Figure 1.

Figure 1

1  total ← 0
2  value ← USERINPUT
3  IF value < 10 THEN
4      OUTPUT "Invalid"
5  ELSE
6      FOR swap ← 1 TO value
7          temp ← USERINPUT
8          total ← total + temp
9      ENDFOR
10     mean ← total / value
11     IF mean > 50 THEN
12         OUTPUT "High"
13     ENDIF
14 ENDIF

Where is iteration first used in the algorithm in Figure 1?

A

Line number 3

B

Line number 6

C

Line number 11

D

Line number 14

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