Skip to content

Course home

Representing algorithms

Representing algorithms

EasyMediumHard
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108
Question 68

An algorithm is being designed to search an alphabetically sorted list of registered delegates for a scientific conference using a binary search.

Here is the pseudocode representation of the algorithm:

delegates ← ["Amara", "Ben", "Chao", "Devi", "Elijah"]
target ← "Elijah"
low ← 0
high ← LEN(delegates) - 1
found ← FALSE

WHILE low C1 high AND NOT found
    mid ← (low + high) DIV 2
    IF delegates[mid] = target THEN
        found ← TRUE
    ELSEIF delegates[mid] < target THEN
        low ← mid + 1
    ELSE
        high ← mid - 1
    ENDIF
ENDWHILE

Identify the comparison operator that must be placed at C1 for the algorithm to function correctly in all cases.

A

<<<

B

≤\le≤

C

≠\ne=

D

>>>

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