Skip to content

Course home

Representing algorithms

Representing algorithms

EasyMediumHard
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091
Question 24

Refer to the algorithm shown in the pseudocode below:

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

What is the largest possible value of the variable count when the user input is 80?

A

3

B

4

C

5

D

20

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