Skip to content

Course home

Representing algorithms

Representing algorithms

EasyMediumHard
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091
Question 30

A smart locker courier system uses an automated terminal to manage parcel collections.

State the items from Figure 2 that should be written in place of the labels L1, L2, L3, and L4 in the algorithm shown in Figure 1.

You will not need to use all the items in Figure 2.

  • L1:
  • L2:
  • L3:
  • L4:

Figure 1

pinFound ← False
REPEAT
    enteredPIN ← ''
    WHILE enteredPIN = ''
        OUTPUT 'Please enter your 6-digit collection PIN: '
        enteredPIN ← L1
    ENDWHILE
    lockerStatus ← checkPinStatus(L2)
    IF lockerStatus = L3 THEN
        OUTPUT L4
    ELSE
        IF lockerStatus = 'Ready' THEN
            pinFound ← True
        ELSE
            OUTPUT 'Locker already opened or expired.'
        ENDIF
    ENDIF
UNTIL pinFound = True
OUTPUT 'Locker door opened. Please collect your parcel.'

Figure 2

'Unrecognized'USER_INPUTenteredPIN
'PIN not recognized. Try again.'TruelockerStatus
'Ready'OUTPUTFalse
pinFound'''Expired'
[4]
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