Tutor HuntTest QuestionsComputing QuestionsYear 10 Computing Questions

 

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

If an 8000-byte file is compressed with a ratio of 4:1, what is the compressed file size?
Which is the main practical difference between lossy and lossless compression?
In information theory, what does "entropy" of data measure in the context of compression?
Which statement best describes the trade-off in lossy compression?
What is the role of a psychoacoustic model in audio compression algorithms like MP3?
For archiving important text documents where exact recovery is required, which compression should be used?
What determines the code length for symbols in Huffman coding?
What does "lossless" compression mean?
What is an advantage of lossless compression?
Which compression algorithm builds a dictionary of repeated patterns during compression?
Which of these file types commonly uses lossy compression for audio?