Skip to content

Course home

Representing algorithms

Representing algorithms

EasyMediumHard
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091
Question 17

State the items from Figure 2 that should be written in place of the labels in the algorithm in Figure 1.

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

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

Figure 1

found ← False
REPEAT
    playerID ← ''
    WHILE playerID = ''
        OUTPUT 'Enter your Player ID: '
        playerID ← L1
    ENDWHILE
    score ← -1
    WHILE score < 0
        OUTPUT 'Enter current score: '
        score ← USERINPUT
    ENDWHILE
    storedHighScore ← getHighScore(L2)
    IF storedHighScore = L3 THEN
        OUTPUT 'Player record not found.'
    ELSE
        IF score > storedHighScore THEN
            OUTPUT 'L4'
            updateHighScore(playerID, score)
        ENDIF
        found ← True
    ENDIF
UNTIL found = True
OUTPUT 'System updated.'

Figure 2

-1USERINPUT'New High Score!'
playerIDFalsegetHighScore
0'Player record not found.'storedHighScore
scoreTrue'Error'
[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