# data[].attributes.body
In your own words, what do you think the Greedy Technique means in algorithms?
Can you think of any real-life examples where a greedy approach works well?

# data[].attributes.body
Why do we need data compression?
What’s inefficient about fixed-length encoding like ASCII?

# data[].attributes.body
Use the Huffman Tree you built to assign binary codes to each character.
Post your result like this:
A: 1100, B: 1101, C: 100, ...

# data[].attributes.body
Why do we say that Huffman’s algorithm is greedy?
What choice is made greedily at each step?

# data[].attributes.body
Given the string: ABACABAD, use your Huffman codes to encode it.
How many bits does it take? Compare it with ASCII encoding.

# data[].attributes.body
What did you find most interesting about Huffman coding?
Where else could greedy techniques be used?

# data[].attributes.body
Given the following frequencies for characters:
A: 5, B: 9, C: 12, D: 13, E: 16, F: 45

Step-by-step, show how you’d build a Huffman Tree.
Use pictures, text, or flowcharts!