Skip to content

Course home

Representing algorithms

Representing algorithms

EasyMediumHard
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108
Question 42

Refer to the algorithm in Figure 1.

1  attempts ← 0
2  success ← False
3  WHILE success = False AND attempts < 3
4      password ← USERINPUT
5      IF password = "secret" THEN
6          success ← True
7          FOR i ← 1 TO 5
8              OUTPUT "Access Granted"
9          ENDFOR
10     ELSE
11         attempts ← attempts + 1
12     ENDIF
13 ENDWHILE

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

A

Line number 3

B

Line number 5

C

Line number 7

D

Line number 11

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