Greedy Technique: Huffman Trees and Codes by Mr. Neeraj Kumar

neeraj14 — 2025-05-15 04:49:36 UTC

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?

neeraj14 — 2025-05-15 04:50:24 UTC

Why do we need data compression?
What’s inefficient about fixed-length encoding like ASCII?

neeraj14 — 2025-05-15 04:51:22 UTC

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!

neeraj14 — 2025-05-15 04:52:10 UTC

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

neeraj14 — 2025-05-15 04:53:38 UTC

Why do we say that Huffman’s algorithm is greedy?
What choice is made greedily at each step?

neeraj14 — 2025-05-15 04:54:20 UTC

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

neeraj14 — 2025-05-15 04:56:45 UTC

What did you find most interesting about Huffman coding?
Where else could greedy techniques be used?