Skip to content

Course home

Representing algorithms

Representing algorithms

EasyMediumHard
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091
Question 38

An algorithm is shown in the pseudocode below.

numStudents ← USERINPUT
numCoaches ← USERINPUT
bookingFee ← 15
IF numStudents > 80 THEN
    ticketCost ← numStudents * 6
ELSE
    IF numStudents ≥ 40 THEN
        ticketCost ← numStudents * 8
    ELSE
        ticketCost ← numStudents * 10
    ENDIF
ENDIF
totalCost ← ticketCost + (numCoaches * 150)
IF totalCost < 1000 THEN
    totalCost ← totalCost + bookingFee
ENDIF
OUTPUT totalCost

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

RunnumStudentsnumCoachesFinal Output (totalCost)
1302[A]
2505[B]
31003[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