Skip to content

Course home

Representing algorithms

Representing algorithms

EasyMediumHard
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091
Question 9

An algorithm is represented by the following pseudo-code:

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

What is the value of the variable steps immediately after the inner WHILE loop finishes when the user input is 25?

A

3

B

4

C

5

D

12

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