Skip to content

Course home

Representing algorithms

Representing algorithms

EasyMediumHard
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108
Question 55

An automated drinks machine uses an algorithm to determine how many syrup shots to add to a beverage.

Figure 1 shows the algorithm written in pseudocode.

1      size ← USERINPUT
2      IF size = 'small' THEN
3          shots ← 2
4      ELSE IF size = 'medium' THEN
5          shots ← 4
6      ELSE IF size = 'large' THEN
7          shots ← 6
8      ELSE
9          OUTPUT 'invalid size'
10     ENDIF
11     FOR i ← 1 TO shots
12         IF i <= 3 THEN
13             ADD_SYRUP('vanilla')
14         ELSE
15             ADD_SYRUP('caramel')
16         ENDIF
17     ENDFOR

State how many times the subroutine ADD_SYRUP will be called with the parameter 'caramel' if the user input is 'medium' in Figure 1.

[1]
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