Skip to content

Course home

Representing algorithms

Representing algorithms

EasyMediumHard
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108
Question 41

A smart garden controller uses the algorithm shown in Figure 1 to automate greenhouse watering.

Figure 1

1      weather ← USERINPUT
2      IF weather = 'sunny' THEN
3          cycles ← 3
4      ELSE IF weather = 'cloudy' THEN
5          cycles ← 1
6      ELSE IF weather = 'rainy' THEN
7          cycles ← 0
8      ELSE
9          OUTPUT 'weather not recognised'
10     ENDIF
11     FOR i ← 1 TO cycles
12         IF i < 2 THEN
13             ACTIVATE_SPRINKLER('mist')
14         ELSE
15             ACTIVATE_SPRINKLER('jet')
16         ENDIF
17     ENDFOR

How many times would the subroutine ACTIVATE_SPRINKLER be called if the user input is 'sunny' in Figure 1?

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