Skip to content

Course home

Representing algorithms

Representing algorithms

EasyMediumHard
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091
Question 31

A liquid bottling system uses the algorithm shown below to determine how many standard bottles can be filled from a given starting volume of liquid.

constant BATCH_SIZE ← 150
constant RESERVE ← 50
OUTPUT 'Enter total volume of liquid in ml'
liquidVolume ← USERINPUT
stepReduction ← BATCH_SIZE + RESERVE
bottlesFilled ← 0
REPEAT
    liquidVolume ← liquidVolume - stepReduction
    bottlesFilled ← bottlesFilled + 1
UNTIL liquidVolume ≤ 0

Complete the trace table below for when the user enters the value 500 at the prompt.

liquidVolumestepReductionbottlesFilled
500
[4]
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