Skip to content

Course home

Representing algorithms

Representing algorithms

EasyMediumHard
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091
Question 75

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 do not need to use all the items in Figure 2.

Figure 1: Authentication Algorithm

authenticated ← False
REPEAT
    userID ← ""
    WHILE userID = ""
        OUTPUT "Enter User ID: "
        userID ← L1
    ENDWHILE

    userPIN ← ""
    WHILE userPIN = ""
        OUTPUT "Enter PIN: "
        userPIN ← USER_INPUT
    ENDWHILE

    savedPIN ← lookupPIN(L2)
    IF savedPIN = L3 THEN
        OUTPUT L4
    ELSE
        IF userPIN = savedPIN THEN
            authenticated ← True
        ELSE
            OUTPUT "Incorrect PIN."
        ENDIF
    ENDIF
UNTIL authenticated = True
OUTPUT "Welcome to the system."

Figure 2: Available Items

"-1"OUTPUTFalse
userIDTrueuserPIN
"-2""ID invalid""None"
USER_INPUTlookupPIN""
  • L1:
  • L2:
  • L3:
  • L4:
[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