Huffman Coding

Compression makes file sizes...

• Bigger

• Smaller

• The same

Huffman coding uses the ________ of each character to work out their encodings.

• Frequency

• Order in ASCII

• Number value

• Binary value

How do you move through a Huffman tree?

• 0 = right 1 = left

• 0 = left 1 = right

How do you calculate the number of bits in a body of text in ASCII?

• Number of characters (no spaces) * 7

• Number of characters (including spaces) * 7

What is Huffman coding?

• A lossy compression method

• A lossless compression method

• A programming language

• A type of encryption algorithm

Answer explanation

Huffman coding is a lossless compression method that efficiently encodes data by assigning shorter codes to more frequent characters.

What is often compressed using Huffman coding?

• Video files

• Audio files

• Text documents

• Executable files

Answer explanation

Huffman coding is often used to compress text documents efficiently, making them the correct choice in this case.

How many characters does the phrase 'Peter Piper picked a pepper' contain, including spaces?

• 26

• 27

• 25

• 28

Answer explanation

The phrase 'Peter Piper picked a pepper' contains 27 characters, including spaces. Therefore, the correct answer is 27.

What data structure does Huffman coding use?

• Linked lists

• Binary trees

• Arrays

• Graphs

Answer explanation

Huffman coding makes use of binary trees to efficiently encode data by assigning shorter codes to more frequent characters.

In Huffman coding, where do characters that occur more frequently appear in the tree?

• Outside the tree

• Towards the top

• Towards the bottom

• Randomly placed

Answer explanation

In Huffman coding, characters that occur more frequently appear towards the top of the tree as they are assigned shorter codes, optimizing the encoding process.

How is the character 'P' encoded using the Huffman tree in the example?

• 1 1

• 1 0

• 0 1

• 0 0

Answer explanation

The character 'P' is encoded as 1 0 in the Huffman tree example, where 'P' is represented by 1 and the path to reach 'P' is 0.