22.5.2. Global Optimal Solution

Try these first

1. 1.

   What does Huffman coding aim to achieve?

   Hint

   Think about how we can save space in data storage.

2. 2.

   Define a greedy algorithm.

   Hint

   Consider choices that seem best at each moment.

3. 3.

   What is the primary purpose of Huffman coding?

   • To encrypt data
   • To compress data
   • To store data efficiently

   Hint

   Consider how bytes can be represented more efficiently.

4. 4.

   Is Huffman coding a greedy algorithm?

   • True
   • False

   Hint

   Recall the characteristic of greedy algorithms.

5. 5.

   You have characters A, B, C, D, E with frequencies 0.1, 0.3, 0.2, 0.4, and 0.5. Create the Huffman tree and explain each step.

   Hint

   Focus on starting with the two smallest frequencies.

6. 6.

   Discuss why Huffman coding might not work well with certain data patterns. Provide an example.

   Hint

   Consider cases where frequencies don't vary greatly.