Skip to content

Course home

Programming concepts

Programming concepts

EasyMediumHard
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140
Question 44

An algorithm for searching an array is shown in Figure 1.

1  target ← "cherry"
2  stock ← ["apple", "banana", "cherry", "date"]
3  itemFound ← false
4  i ← 0
5  WHILE i < 4 AND itemFound = false
6      IF stock[i] = target THEN
7          itemFound ← true
8      ENDIF
9      i ← i + 1
10 ENDWHILE

Figure 1

Explain why using the identifier itemFound is a better choice than using the identifier f.

[2]
Markscheme

Programming concepts Questions

  1. GCSE
  2. /Computer Science
  3. /Programming concepts

298 exam-style questions on AQA GCSE Computer Science Programming concepts. Each one has a worked solution and a mark scheme showing where the marks go.

Question bank