Skip to content

Course home

Representing algorithms

Representing algorithms

EasyMediumHard
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091
Question 18

An algorithm is represented below using pseudo-code.

1      latency ← USERINPUT
2      IF NOT(latency > 50) AND latency < 20 THEN
3          OUTPUT "Standard"
4      ELSEIF latency MOD 4 = 0 AND NOT(latency > 30) THEN
5          OUTPUT "Priority"
6      ELSEIF latency >= 20 AND latency < 40 THEN
7          OUTPUT "Express"
8      ELSEIF latency MOD 3 = 0 THEN
9          OUTPUT "Economy"
10     ELSE
11         OUTPUT "Bulk"
12     ENDIF

What will be the output from this algorithm when the user input is 24?

Shade one circle to indicate your answer.

A

"Standard"

B

"Priority"

C

"Express"

D

"Economy"

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