Skip to content

Course home

Programming concepts

Programming concepts

EasyMediumHard
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140
Question 39

A programmer is writing a subroutine to search for a specific value, target, within an array called list. The subroutine is shown below:

SUBROUTINE search(target, list)
  i ← 0
  f ← FALSE
  WHILE i < LENGTH(list) DO
    IF list[i] == target THEN
      f ← TRUE
    ENDIF
    i ← i + 1
  ENDWHILE
  OUTPUT f
ENDSUBROUTINE

The identifier for the variable f is not a good choice.

State a better identifier for this variable that makes the algorithm easier to read and understand.

[1]
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