An algorithm for an automated supermarket checkout kiosk helper is shown in Figure 1.
Regardless of what the user inputs, the same number of OUTPUT instructions will always execute when the algorithm runs.
Figure 1
1 OUTPUT 'Welcome to the automated checkout.'
2 bagOption ← USERINPUT
3 IF bagOption = 'yes' THEN
4 OUTPUT 'How many bags do you need?'
5 count ← USERINPUT
6 IF count > 5 THEN
7 OUTPUT 'Please ask an assistant for assistance.'
8 ELSE
9 OUTPUT 'Please scan your items now.'
10 ENDIF
11 ELSE
12 OUTPUT 'Do you have your own bags?'
13 ownBag ← USERINPUT
14 IF ownBag = 'yes' THEN
15 OUTPUT 'Please scan your items now.'
16 ELSE
17 OUTPUT 'A helper will bring a basket.'
18 ENDIF
19 ENDIF
State how many OUTPUT instructions will execute whenever this algorithm is run.
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.