Skip to content

Course home

Representing algorithms

Representing algorithms

EasyMediumHard
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091
Question 66

An algorithm is shown in the pseudocode below.

numAcres ← USERINPUT
numDrones ← USERINPUT
serviceCharge ← 45
IF numAcres > 120 THEN
    sprayCost ← numAcres * 12
ELSE
    IF numAcres ≥ 60 THEN
        sprayCost ← numAcres * 15
    ELSE
        sprayCost ← numAcres * 20
    ENDIF
ENDIF
totalCharge ← sprayCost + (numDrones * 180)
IF totalCharge < 1500 THEN
    totalCharge ← totalCharge + serviceCharge
ENDIF
OUTPUT totalCharge

Complete the table below to show the outputs for each of the given test runs.

RunnumAcresnumDronesFinal Output (totalCharge)
1402[A]
2804[B]
31503[C]
[3]
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