Skip to content

Course home

Representing algorithms

Representing algorithms

EasyMediumHard
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108
Question 51

An algorithm has been developed to automate a coffee machine syrup dispenser based on the strength of flavor selected by a customer.

1      amount ← USERINPUT
2      IF amount = 'mild' THEN
3          shots ← 1
4      ELSE IF amount = 'medium' THEN
5          shots ← 3
6      ELSE IF amount = 'strong' THEN
7          shots ← 4
8      ELSE
9          OUTPUT 'Invalid selection'
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

How many times would the subroutine ADD_SYRUP be called if the user input is 'medium'?

A

1 subroutine call

B

2 subroutine calls

C

3 subroutine calls

D

4 subroutine calls

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