Skip to content

Course home

Representing algorithms

Representing algorithms

EasyMediumHard
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108
Question 91

An algorithm is shown in Figure 1.

Figure 1

1  total_score ← 0
2  target ← 150
3  player_name ← USERINPUT
4  IF player_name = '' THEN
5      player_name ← 'Guest'
6  ENDIF
7  REPEAT
8      points ← USERINPUT
9      IF points > 0 THEN
10         total_score ← total_score + points
11     ENDIF
12 UNTIL total_score ≥ target
13 OUTPUT 'Game Over', player_name

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

A

Line 4

B

Line 12

C

Line 7

D

Line 9

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