Skip to content

Course home

Representing algorithms

Representing algorithms

EasyMediumHard
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091
Question 78

An algorithm is shown in the pseudocode below:

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

What will be output when the user input is 9?

A

2

B

3

C

4

D

9

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