Skip to content

Course home

Representing algorithms

Representing algorithms

EasyMediumHard
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108
Question 25

An algorithm is represented in the pseudocode below:

1  n ← USERINPUT
2  IF n MOD 3 = 0 THEN
3      OUTPUT n + 5
4  ELSE
5      OUTPUT n * 2
6  ENDIF

Select the option that shows the output from the algorithm when the user input is 6.

A

222

B

666

C

111111

D

121212

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