Skip to content

Course home

Representing algorithms

Representing algorithms

EasyMediumHard
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091
Question 60

An algorithm for managing a server's task queue is shown in the pseudocode below.

1  active ← True
2  WHILE active = True
3      p ← USERINPUT
4      IF p > 2 THEN
5          steps ← 0
6          WHILE p > 2
7              p ← p DIV 3
8              steps ← steps + 2
9          ENDWHILE
10     ELSE
11         active ← False
12     ENDIF
13     OUTPUT p
14 ENDWHILE

What is the value of the variable steps after the inner loop terminates when the user input is 150?

A

666

B

888

C

101010

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