Skip to content

Course home

Representing algorithms

Representing algorithms

EasyMediumHard
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091
Question 33

An algorithm is represented below using pseudo-code.

1      score ← USERINPUT
2      IF NOT(score > 5) AND score < 15 THEN
3          OUTPUT "Red"
4      ELSEIF score > 10 AND score < 20 THEN
5          OUTPUT "Amber"
6      ELSEIF score MOD 3 = 0 THEN
7          OUTPUT "Green"
8      ELSE
9          OUTPUT "Blue"
10     ENDIF

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

A

Red

B

Amber

C

Green

D

Blue

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