Skip to content

Course home

Representing algorithms

Representing algorithms

EasyMediumHard
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108
Question 105

Select one option to show which of the following is the false statement about the algorithm in Figure 1.

Figure 1

1  nums ← [12, 5, 8, 5, 14]
2  hasDuplicate ← false
3  p ← 0
4  WHILE p < 5 AND hasDuplicate = false
5      q ← p + 1
6      WHILE q < 5 AND hasDuplicate = false
7          IF nums[p] = nums[q] THEN
8              hasDuplicate ← true
9          ENDIF
10         q ← q + 1
11     ENDWHILE
12     p ← p + 1
13 ENDWHILE
A

The algorithm uses definite iteration

B

The algorithm uses nested iteration

C

The algorithm uses a boolean variable

D

The algorithm uses selection

Markscheme

Representing algorithms Questions

  1. GCSE
  2. /Computer Science
  3. /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.

Question bank