Skip to content

Course home

Representing algorithms

Representing algorithms

EasyMediumHard
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091
Question 61

An algorithm is represented in the pseudocode below.

numTickets ← USERINPUT
numVIPPasses ← USERINPUT
bookingFee ← 15
IF numTickets > 40 THEN
    totalCost ← numTickets * 8
ELSE
    IF numTickets ≥ 15 THEN
        totalCost ← numTickets * 10
    ELSE
        totalCost ← numTickets * 12
    ENDIF
ENDIF
totalCost ← totalCost + (numVIPPasses * 50)
IF totalCost < 800 THEN
    totalCost ← totalCost + bookingFee
ENDIF
OUTPUT totalCost

Complete the table below to show the outputs of the algorithm.

Input value for numTicketsInput value for numVIPPassesOutput
4015
106
1002
[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