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 68

A user inputs an integer value into the algorithm shown in Figure 1.

Figure 1

1      val ← USERINPUT
2      IF NOT(val > 3) OR val > 30 THEN
3          OUTPUT "Invalid"
4      ELSEIF val > 3 AND val < 20 THEN
5          OUTPUT "Low"
6      ELSEIF val MOD 3 = 0 THEN
7          OUTPUT "Multiple"
8      ELSE
9          OUTPUT "Default"
10     ENDIF

State one integer value that the user could input that would result in an output of "Default".

[1]

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 68

A user inputs an integer value into the algorithm shown in Figure 1.

Figure 1

1      val ← USERINPUT
2      IF NOT(val > 3) OR val > 30 THEN
3          OUTPUT "Invalid"
4      ELSEIF val > 3 AND val < 20 THEN
5          OUTPUT "Low"
6      ELSEIF val MOD 3 = 0 THEN
7          OUTPUT "Multiple"
8      ELSE
9          OUTPUT "Default"
10     ENDIF

State one integer value that the user could input that would result in an output of "Default".

[1]

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.