Computer Science GCES AQA
-
Representing Algorithms Aqa4 主题
-
Efficiency Of Algorithms Aqa1 主题
-
Searching Algorithms Aqa3 主题
-
Sorting Algorithms Aqa3 主题
-
Data Types Aqa1 主题
-
Programming Concepts Aqa5 主题
-
Arithmetic Relational And Boolean Operations Aqa1 主题
-
Data Structures Aqa3 主题
-
String Manipulation Aqa1 主题
-
Random Number Generation Aqa1 主题
-
Structured Programming Aqa2 主题
-
Robust And Secure Programming Aqa4 主题
-
Number Bases Aqa2 主题
-
Converting Between Number Bases Aqa3 主题
-
Units Of Information Aqa9 主题
-
Hardware And Software Aqa4 主题
-
Boolean Logic Aqa3 主题
-
Programming Languages And Translators Aqa2 主题
-
Cpu Architecture Performance And Embedded Systems Aqa4 主题
-
Memory Aqa2 主题
-
Secondary Storage Aqa3 主题
-
Fundamentals Of Computer Networks Aqa8 主题
-
Fundamentals Of Cyber Security Aqa1 主题
-
Methods Of Preventing Cyber Security Threats Aqa1 主题
-
Relational Databases Aqa2 主题
-
Ethical Legal And Environmental Impacts Aqa2 主题
Compression Run Length Encoding Aqa
Exam code:8525
Run Length Encoding
What is run-length encoding?
-
Run-length encoding (RLE) is a form of data compression that condenses identical elements into a single value with a count
Text files
-
For a text file containing the string “AAAABBBCCDAA“, the plain RLE encoding would be “4A3B2C1D2A“
-
The string has:
-
four ‘A’s (4A)
-
three ‘B’s (3B)
-
two ‘C’s (2C)
-
one ‘D’ (1D)
-
two ‘A’s (2A)
-
-
To represent this in binary, the count is stored in a fixed size binary format (e.g. 7 or 8 bits)
-
The character is stored using its ASCII (opens in a new tab) value (7 bits)
-
The binary RLE representation of 4A would be
0000100 1000001-
000 0100– binary for the count (4) -
100 0001– binary for ‘A’ (65)
-
Images
-
In bitmap images, RLE is used to compress sequences of the same colour
-
For example, a line in an image with 5 red pixels followed by 3 blue pixels could be represented as “5R3B“
-
The image has:
-
5 red pixels (5R)
-
3 blue pixels (3B)
-
-
To represent this in binary, the pixel count is stored in a fixed size binary format (e.g. 1, 4, 8 or 16 bits)
-
The colour is stored based on the required colour depth (opens in a new tab) of the image
-
For this example we will assume a colour depth of 2 bits
-
00– Black -
01– Red -
10– Green -
11– Blue
-
-
The binary representation of 5R3B would be
0101 01 0011 11-
0101– pixel count (5),01– red -
0011– pixel count (3),11– blue
-
Examiner Tips and Tricks
In the exam, the count and value/colour can be reversed, e.g.
-
A4 instead of 4A (four A’s)
-
R5 instead of 5R (five red pixels)
Make sure you read the question carefully!
Represent Data in Frequency / Data Pairs
How do you represent data in frequency/data pairs?
-
Run-length encoding (RLE) uses frequency/data pairs to compress bitmap image data
-
For example, the following bitmap image with a colour depth of 1 bit would have the following binary bit pattern
|
Bitmap |
Bit pattern |
|---|---|
![]() |
![]() |
-
Using RLE we group pixel colours and can create frequency/data pairs as follows
-
30, 11, 20, 11, 20, 11, 50, 11, 30, 11, 10, 11, 60, 11……
-

-
3 x 0 = 3 x white, 1 x 1 = 1 x black
-
Data pairs can carry over on to the next line, e.g. end of first line and start of second line is 5 x 0 (5 x white)
How do you represent a bitmap image from frequency/data pairs?
-
To recreate a simple bitmap from frequency/data pairs you need to know what binary code is assigned to what colour and reverse the process above
-
If we assume 0 = white and 1 = black and have the following frequency/data pairs and the image size is 5×3 pixels
-
20, 11, 30, 31, 10, 51
-
-
The bitmap image would be



Responses