Skip to content

Course home

Representing algorithms

Representing algorithms

EasyMediumHard
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091
Question 89

A library uses a software system to manage book checkouts.

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

bookFound ← False
REPEAT
    isbn ← ''
    WHILE isbn = ''
        OUTPUT 'Scan or enter book ISBN: '
        isbn ← L1
    ENDWHILE
    status ← getBookStatus(L2)
    IF status = L3 THEN
        OUTPUT 'L4'
    ELSE
        IF status = 'Available' THEN
            bookFound ← True
        ELSE
            OUTPUT 'Book is currently loaned out.'
        ENDIF
    ENDIF
UNTIL bookFound = True
OUTPUT 'Book issued successfully.'

Figure 2

'Not Found'USERINPUTisbn
'Invalid ISBN'Truestatus
'Available'OUTPUTFalse
bookFound0''
[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