Course home

Representing algorithms

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108

Question 14

State why both BASE_FEE and BOOKING_FEE from the algorithm in Figure 3 did not need to be included in a trace table.

Figure 3

constant BASE_FEE ← 15
constant BOOKING_FEE ← 3
OUTPUT 'Enter money paid'
payment ← USERINPUT
totalCost ← BASE_FEE + BOOKING_FEE
ticketsBought ← 0
REPEAT
    payment ← payment - totalCost
    ticketsBought ← ticketsBought + 1
UNTIL payment < totalCost

[1]

Markscheme

Representing algorithms Questions

GCSE
Computer Science
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.

Representing algorithms

Question bank

Representing algorithms

Easy Medium Hard

Question 14

State why both BASE_FEE and BOOKING_FEE from the algorithm in Figure 3 did not need to be included in a trace table.

Figure 3

constant BASE_FEE ← 15
constant BOOKING_FEE ← 3
OUTPUT 'Enter money paid'
payment ← USERINPUT
totalCost ← BASE_FEE + BOOKING_FEE
ticketsBought ← 0
REPEAT
    payment ← payment - totalCost
    ticketsBought ← ticketsBought + 1
UNTIL payment < totalCost

[1]

Markscheme

Representing algorithms Questions

GCSE
Computer Science
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.