Skip to content

Course home

Representing algorithms

Representing algorithms

EasyMediumHard
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108
Question 1

A mobile computer technician uses an algorithm to determine the callout fee for a home service visit based on the duration of the job and the service zone code.

Figure 1

jobDuration ← USERINPUT
zoneCode ← USERINPUT
calloutFee ← 0.0
messageOne ← "Minimum time not met"
messageTwo ← "Service zone out of range"
IF zoneCode ≤ 3 AND jobDuration > 0.0 THEN
    IF jobDuration > 4.5 THEN
        calloutFee ← 20.0
        OUTPUT calloutFee
    ELSE IF jobDuration > 2.0 THEN
        calloutFee ← (jobDuration * 10) + 12.0
        OUTPUT calloutFee
    ELSE
        OUTPUT messageOne
    ENDIF
ELSE
    OUTPUT messageTwo
ENDIF

Using Figure 1, complete the table below.

Input value of jobDurationInput value of zoneCodeOutput
5.02
3.03
[2]
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