Skip to content

Course home

Representing algorithms

Representing algorithms

EasyMediumHard
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108
Question 19

An algorithm is being developed to compress a sequence of pixel data using Run-Length Encoding (RLE).

Below is the pseudocode representation of the algorithm:

pixels ← "AAABBC"
i ← 0
run_length ← 1
WHILE i < LEN(pixels) - 1
    IF pixels[i] C1 pixels[i + 1] THEN
        OUTPUT run_length
        OUTPUT pixels[i]
        run_length ← 1
    ELSE
        run_length ← run_length + 1
    ENDIF
    i ← i + 1
ENDWHILE
OUTPUT run_length
OUTPUT pixels[i]

Which comparison operator should be placed at C1 for the algorithm to work correctly?

A

===

B

<<<

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