22.4.1. Efficiency of Finding Minimum Values

Try these first

1. 1.

   What is Huffman coding used for?

   Hint

   Think about how data is represented.

2. 2.

   What is the basic tree structure used in Huffman coding?

   Hint

   Focus on the definition of a binary tree.

3. 3.

   What is the key purpose of Huffman coding?

   • To reduce data size for transmission
   • To increase data redundancy
   • To simplify the data structure

   Hint

   Think about what happens during data transmission.

4. 4.

   A greedy algorithm makes decisions that are:

   • True
   • False

   Hint

   Focus on the definition of greedy algorithms.

5. 5.

   Given frequencies A: 0.1, B: 0.4, C: 0.2, D: 0.3, create the Huffman tree and assign binary codes.

   Hint

   Use the smallest frequencies first and build up.

6. 6.

   Discuss the ramifications of using a non-greedy approach in Huffman coding. What could go wrong?

   Hint

   Think about how the encoding quality could degrade.