AQA 3.3 Data Representation - KO 6 - Compression

AQA 3.3 Data Representation - KO 6 - Compression

10th Grade

13 Qs

Similar activities

Crash Course Computer Science #21 - Compression

Crash Course Computer Science #21 - Compression

9th - 12th Grade

17 Qs

85. Data Rep - Compression Techniques Quiz

85. Data Rep - Compression Techniques Quiz

9th - 12th Grade

11 Qs

Data Compression

Data Compression

9th - 12th Grade

15 Qs

Code.org Unit 2

Code.org Unit 2

9th - 12th Grade

14 Qs

Recap Homework - Data Representation

Recap Homework - Data Representation

10th Grade

15 Qs

APCSP - Unit 1 Review

APCSP - Unit 1 Review

10th - 12th Grade

15 Qs

Huffman Coding

Huffman Coding

6th - 10th Grade

10 Qs

Compression Quiz

Compression Quiz

10th - 11th Grade

14 Qs

AQA 3.3 Data Representation - KO 6 - Compression

AQA 3.3 Data Representation - KO 6 - Compression

Assessment

Quiz

Created by

Mark Weddell

Computers

10th Grade

Hard

13 questions

Show all answers

1.

FILL IN THE BLANK QUESTION

1 min • 1 pt

The purpose of data compression is to make the files ________

2.

FILL IN THE BLANK QUESTION

1 min • 1 pt

Smaller file sizes means that it takes less time to ________ the data

3.

FILL IN THE BLANK QUESTION

1 min • 1 pt

Data compression also means that files take up less ______ in _______

4.

FILL IN THE BLANK QUESTION

1 min • 1 pt

The uncompressed size of an ASCII phrase is number of __________ including ______ multiplied by _______

5.

FILL IN THE BLANK QUESTION

1 min • 1 pt

RLE compression is an abbreviation for _______ _______ ________

6.

FILL IN THE BLANK QUESTION

1 min • 1 pt

RLE is a compression method where __________ (or runs) of the same values are encoded as pairs.

7.

FILL IN THE BLANK QUESTION

1 min • 1 pt

In Run Length Encoding each pair is made up of the _________ itself and the __________ of them that appear in the run.

8.

FILL IN THE BLANK QUESTION

1 min • 1 pt

Using Run Length Encoding ABBA would be stored as A1 __ A1

9.

FILL IN THE BLANK QUESTION

1 min • 1 pt

Huffman coding is a form of compression that uses a tree.

10.

FILL IN THE BLANK QUESTION

1 min • 1 pt

Huffman coding uses fewer _____ for higher _________ data.

Explore all questions with a free account

or continue with
Microsoft
Apple
Others
By signing up, you agree to our Terms of Service & Privacy Policy
Already have an account?