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 63

State the final value of the variable valid in the algorithm below for the following different starting values of dataStr:

cmd ← ''
j ← 0
WHILE dataStr[j] ≠ '#' AND j < 4
    cmd ← cmd + dataStr[j]
    j ← j + 1
ENDWHILE
valid ← False
IF cmd = 'GET' OR cmd = 'PUT' OR cmd = 'EXIT' THEN
    valid ← True
ENDIF

GET#data

[1]

PUT data

[1]

EXIT

[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 63

State the final value of the variable valid in the algorithm below for the following different starting values of dataStr:

cmd ← ''
j ← 0
WHILE dataStr[j] ≠ '#' AND j < 4
    cmd ← cmd + dataStr[j]
    j ← j + 1
ENDWHILE
valid ← False
IF cmd = 'GET' OR cmd = 'PUT' OR cmd = 'EXIT' THEN
    valid ← True
ENDIF

GET#data

[1]

PUT data

[1]

EXIT

[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.