Data Representation8G – ReviseComputerScience

Skip to content

ReviseComputerScience

Free Resources
Student Dashboard
Teacher Dashboard
Legal
Login
Cart / £0.00
0

You do not have access to this content.

In order to access the 'Quiz Zone' and all of its contents, please purchase a 'Premium Course'.

Time limit: 0

Quiz Summary

0 of 10 questions completed

Questions:

1
2
3
4
5
6
7
8
9
10

Information

You have already completed the quiz before. Hence you can not start it again.

Quiz is loading...

You must sign in or sign up to start the quiz.

You must first complete the following:

Results

Quiz complete. Results are being recorded.

Results

0 of 10 questions answered correctly

Your time:

Time has elapsed

You have reached 0 of 0 point(s), (0)

Earned Point(s): 0 of 0, (0)
0 Essay(s) Pending (Possible Point(s): 0)

Categories

Data Representation 0%

Relax, the test is over…review your answers and see if you need to go over aspects of this topic again.

1
2
3
4
5
6
7
8
9
10

Answered
Review

Question 1 of 10

1. Question
'Lossy Compression' is best described as...
- A form of file compression that reduces the file size by permanently removing some of its data.
- A form of file compression that reduces the file size by temporarily removing some of it is data. This data is is reconstructed when the file is uncompressed.
Correct

Incorrect
Question 2 of 10

2. Question
'Lossless Compression' is best described as...
- A form of file compression that reduces the file size by permanently removing some of its data.
- A form of file compression that reduces the file size by temporarily removing some of it is data. This data is is reconstructed when the file is uncompressed.
Correct

Incorrect
Question 3 of 10

3. Question
'Run Length Encoding' is...
- ...a form of lossless compression that seeks to find patterns / sequences of data that can be encoded using fewer bits that the original data.
- ...a form of lossless compression, which looks to replace the file’s data with a reference to what the data is. For example, repeatedly replacing the data that represents a particular word with the indexed location of where that word is stored in a dictionary.
- ...a form of lossy compression that seeks to find patterns / sequences of data that can be encoded using fewer bits that the original data.
- ...a form of lossy compression, which looks to replace the file’s data with a reference to what the data is. For example, repeatedly replacing the data that represents a particular word with the indexed location of where that word is stored in a dictionary.
- ...a form of lossless compression, which looks at how many times each character appears in a piece of text and assigns each character that appears with a temporary binary code/number, with the most frequent character getting the smallest binary code and the least frequent character getting the largest code.
- ...a form of lossy compression, which looks at how many times each character appears in a piece of text and assigns each character that appears with a temporary binary code/number, with the most frequent character getting the smallest binary code and the least frequent character getting the largest code.
Correct

Incorrect
Question 4 of 10

4. Question
'Dictionary Coding' is...
- ...a form of lossless compression that seeks to find patterns / sequences of data that can be encoded using fewer bits that the original data.
- ...a form of lossless compression, which looks to replace the file’s data with a reference to what the data is. For example, repeatedly replacing the data that represents a particular word with the indexed location of where that word is stored in a dictionary.
- ...a form of lossy compression that seeks to find patterns / sequences of data that can be encoded using fewer bits that the original data.
- ...a form of lossy compression, which looks to replace the file’s data with a reference to what the data is. For example, repeatedly replacing the data that represents a particular word with the indexed location of where that word is stored in a dictionary.
- ...a form of lossless compression, which looks at how many times each character appears in a piece of text and assigns each character that appears with a temporary binary code/number, with the most frequent character getting the smallest binary code and the least frequent character getting the largest code.
- ...a form of lossy compression, which looks at how many times each character appears in a piece of text and assigns each character that appears with a temporary binary code/number, with the most frequent character getting the smallest binary code and the least frequent character getting the largest code.
Correct

Incorrect
Question 5 of 10

5. Question
'Huffman Coding ' is...
- ...a form of lossless compression that seeks to find patterns / sequences of data that can be encoded using fewer bits that the original data.
- ...a form of lossless compression, which looks to replace the file’s data with a reference to what the data is. For example, repeatedly replacing the data that represents a particular word with the indexed location of where that word is stored in a dictionary.
- ...a form of lossy compression that seeks to find patterns / sequences of data that can be encoded using fewer bits that the original data.
- ...a form of lossy compression, which looks to replace the file’s data with a reference to what the data is. For example, repeatedly replacing the data that represents a particular word with the indexed location of where that word is stored in a dictionary.
- ...a form of lossless compression, which looks at how many times each character appears in a piece of text and assigns each character that appears with a temporary binary code/number, with the most frequent character getting the smallest binary code and the least frequent character getting the largest code.
- ...a form of lossy compression, which looks at how many times each character appears in a piece of text and assigns each character that appears with a temporary binary code/number, with the most frequent character getting the smallest binary code and the least frequent character getting the largest code.
Correct

Incorrect
Question 6 of 10

6. Question
When creating a 'tree' during the huffman coding compression method, what is the correct order of steps that need to be carried out?
- 1 Join (as a tree) the first two nodes from the right, adding the frequencies together and adding this sum to the root node.
  2 Re-insert the root node of the tree into the correct numerical position
  3 Repeat until only one node is left
- 1 Join (as a tree) the first two nodes from the right, adding the frequencies together and adding this sum to the root node.
  2 Repeat until only one node is left
  3 Re-insert the root node of the tree into the correct numerical position
- 1 Re-insert the root node of the tree into the correct numerical position
  2 Join (as a tree) the first two nodes from the right, adding the frequencies together and adding this sum to the root node.
  3 Repeat until only one node is left
- 1 Re-insert the root node of the tree into the correct numerical position
  2 Repeat until only one node is left
  3 Join (as a tree) the first two nodes from the right, adding the frequencies together and adding this sum to the root node.
Correct

Incorrect
Question 7 of 10

7. Question
In a tree data structure, what is a node?
- A node is a piece of data in memory.
- A node is a memory location which contains data and (if the node has children) pointers.
- A node is a computer on a network.
- A node is the name given to a complete binary tree.
Correct

Incorrect
Question 8 of 10

8. Question
Select the advantages of compression from the list below:
- Less storage space required.
- Faster download times – improving online experience.
- Improved definition of video when streaming.
- Faster steaming speeds of video/audio files.
- Slower but more reliable processing of data.
- An increase in bandwidth.
Correct

Incorrect
Question 9 of 10

9. Question
MP3s are an example of a file that has been compressed using which compression method?
- Lossy
- Lossless
Correct

Incorrect
Question 10 of 10

10. Question
Zip files are an example of files that have been compressed using which compression method?
- Lossy
- Lossless
Correct

Incorrect

Copyright © 2020 ReviseComputerScience | Powered by Astra WordPress Theme

Scroll to Top

Login

Username or Email Address

Password

Remember Me

Lost Your Password?