Skip to content

Course home

Representing algorithms

Representing algorithms

EasyMediumHard
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091
Question 29

An algorithm is shown in the pseudocode below:

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

What will be the first value output when the user inputs 18?

A

333

B

444

C

555

D

999

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