Data Representation - Compression (GCSE Computing)

The following is a GCSE Computing test covering 'Data Representation - Compression'

Incorrect: 0

Correct: 0

Question 1

...

Congratulations - you have completed the test!

Your final score was

Below a typical questions that will be covered in this test. You final score will be logged on your account

Which compression algorithm builds a dictionary of repeated patterns during compression?

Which image format commonly uses lossless compression and is popular on the web?

How is compression ratio normally calculated?

Run-length encoding (RLE) is most effective on which type of data?

What determines the code length for symbols in Huffman coding?

Which type of data is typically the hardest to compress?

In information theory, what does "entropy" of data measure in the context of compression?

For archiving important text documents where exact recovery is required, which compression should be used?

In Huffman coding, what usually happens to rare symbols compared to frequent symbols?

Which statement about compressed files is true?

What does "lossy" compression mean?

Similiar Tests