Course home

Representing algorithms

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91

Question 14

Refer to the algorithm in Figure 1.

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

Figure 1

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

$3$

$4$

$5$

$6$

Markscheme

Representing algorithms Questions

GCSE
Computer Science
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.

Representing algorithms

Question bank

Representing algorithms

Easy Medium Hard

Question 14

Refer to the algorithm in Figure 1.

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

Figure 1

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

$3$

$4$

$5$

$6$

Markscheme

Representing algorithms Questions

GCSE
Computer Science
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.