Huffman Encoding in DSA C - Practice Problems & Challenges

Challenge - 5 Problems

❓ Predict Output

intermediate

Output of Huffman Encoding Tree Construction

What is the output of the following code that builds a Huffman tree and prints the codes for each character?

DSA C

typedef struct Node {
    char ch;
    int freq;
    struct Node *left, *right;
} Node;

// Assume a min-heap and tree building functions are implemented correctly

// Characters and frequencies
char chars[] = {'a', 'b', 'c', 'd', 'e', 'f'};
int freq[] = {5, 9, 12, 13, 16, 45};

// After building Huffman tree, codes are printed
// Output format: character: code
// For example: a: 110

// The expected codes are:
// f: 0
// c: 100
// d: 101
// a: 1100
// b: 1101
// e: 111

// The printed output is:
// f: 0
// c: 100
// d: 101
// a: 1100
// b: 1101
// e: 111

A { "f": "111", "c": "110", "d": "101", "a": "100", "b": "0", "e": "10" }

B { "a": "0", "b": "10", "c": "110", "d": "1110", "e": "11110", "f": "11111" }

C { "a": "00", "b": "01", "c": "10", "d": "110", "e": "111", "f": "1" }

D { "f": "0", "c": "100", "d": "101", "a": "1100", "b": "1101", "e": "111" }

💡 Hint

Recall that characters with higher frequency get shorter codes in Huffman encoding.

The Huffman tree built from the given frequencies assigns the shortest code to 'f' (highest frequency) and longer codes to less frequent characters. Option D matches the correct Huffman codes.

🧠 Conceptual

intermediate

Minimum Number of Bits in Huffman Encoding

Given characters with frequencies: {'x': 10, 'y': 15, 'z': 30}, what is the minimum total number of bits needed to encode the string "xyzxyz" using Huffman encoding?

A 12 bits

B 16 bits

C 10 bits

D 14 bits

💡 Hint

Calculate the Huffman codes for each character and multiply by their occurrences in the string.

The Huffman codes assign shorter codes to higher frequency characters. For "xyzxyz", total bits = sum of (code length * frequency in string). Option C matches the correct calculation.

🔧 Debug

advanced

Identify the Error in Huffman Tree Node Comparison

What error does the following C code snippet cause when used in building a Huffman tree? typedef struct Node { char ch; int freq; struct Node *left, *right; } Node; int compare(const void *a, const void *b) { Node *nodeA = (Node *)a; Node *nodeB = (Node *)b; return nodeA->freq - nodeB->freq; } // Used in qsort to sort array of Node pointers

A Incorrect sorting because pointers are not dereferenced properly

B Segmentation fault due to incorrect pointer casting

C Compilation error due to incompatible pointer types

D No error; code works correctly

💡 Hint

Consider what qsort passes to the compare function when sorting pointers.

qsort passes pointers to elements, so when sorting an array of Node pointers, the compare function receives pointers to pointers. The code casts to Node* instead of Node** and dereferences incorrectly, causing wrong sorting.

🚀 Application

advanced

Huffman Encoding Compression Ratio Calculation

A file contains 1000 characters: 400 'A's, 300 'B's, 200 'C's, and 100 'D's. Using Huffman encoding, what is the approximate compression ratio compared to fixed-length 2-bit encoding per character?

A Compression ratio is approximately 1.25 (25% smaller)

B Compression ratio is approximately 0.6 (40% smaller)

C Compression ratio is approximately 0.8 (20% smaller)

D Compression ratio is approximately 0.5 (50% smaller)

💡 Hint

Calculate average bits per character using Huffman codes and compare with fixed 2 bits per character.

Fixed-length encoding uses 2 bits per character. Huffman encoding assigns shorter codes to frequent characters, reducing average bits per character. Calculating weighted average bits per character gives about 1.2 bits, so compression ratio = 1.2/2 = 0.6.

🧠 Conceptual

expert

Huffman Encoding Tree Uniqueness

Which statement about the uniqueness of Huffman encoding trees is correct when multiple characters have the same frequency?

A Multiple valid Huffman trees can exist if characters have equal frequencies

B Huffman encoding tree is always unique regardless of frequency ties

C Huffman tree uniqueness depends on the order characters appear in the input string

D Huffman tree is unique only if all frequencies are distinct prime numbers

💡 Hint

Consider how the algorithm chooses nodes when frequencies are equal.

When frequencies tie, the order of combining nodes can vary, leading to different valid Huffman trees with different codes but same total cost.

Practice

1. What is the main goal of Huffman Encoding in data compression?

easy

A. To assign equal length codes to all characters

B. To assign shorter codes to more frequent characters

C. To encrypt data for security

D. To sort characters alphabetically

Solution

1. Step 1: Understand Huffman Encoding purpose

   Huffman Encoding compresses data by giving shorter codes to characters that appear more often.

2. Step 2: Compare options with this purpose

   Only To assign shorter codes to more frequent characters matches this goal; others describe different concepts.

3. Final Answer:

   To assign shorter codes to more frequent characters -> Option B

4. Quick Check:

   Huffman Encoding = shorter codes for frequent chars [OK]

Hint: Remember: frequent chars get shorter codes in Huffman [OK]

Common Mistakes:

• Thinking Huffman assigns equal length codes
• Confusing compression with encryption
• Assuming sorting is the main goal

2. Which data structure is primarily used to build the Huffman tree?

easy

A. Priority Queue (Min-Heap)

B. Stack

C. Queue

D. Hash Table

Solution

1. Step 1: Identify data structure for selecting smallest frequencies

   Huffman tree construction repeatedly picks two smallest frequency nodes.

2. Step 2: Match with data structure that supports this

   Priority Queue (Min-Heap) efficiently provides smallest elements first.

3. Final Answer:

   Priority Queue (Min-Heap) -> Option A

4. Quick Check:

   Smallest freq nodes from Min-Heap [OK]

Hint: Huffman uses Min-Heap to pick smallest frequencies fast [OK]

Common Mistakes:

• Choosing Stack or Queue which don't sort by frequency
• Confusing Hash Table with frequency sorting
• Ignoring the need for smallest frequency extraction

3. What is the output Huffman code for characters with frequencies: A=5, B=9, C=12, D=13, E=16, F=45?

Assuming standard Huffman tree construction, what is the code for character 'F'?

medium

A. 0

B. 10

C. 110

D. 111

Solution

1. Step 1: Build Huffman tree with given frequencies

   Combine smallest pairs: (A=5,B=9)=14, (C=12,D=13)=25, then combine 14 and 16 (E) = 30, then 25 and 30 = 55, finally combine 45 (F) and 55 = 100.

2. Step 2: Assign codes from root; 'F' is combined last and placed on left branch

   Since 'F' has highest frequency, it gets the shortest code '0'.

3. Final Answer:

   0 -> Option A

4. Quick Check:

   Highest freq char gets shortest code '0' [OK]

Hint: Highest frequency char gets code '0' in Huffman [OK]

Common Mistakes:

• Assigning longer codes to highest frequency character
• Mixing up left/right branch codes
• Not building tree step-by-step

4. Consider this C code snippet for building a Huffman tree:

struct Node {
  char data;
  int freq;
  struct Node *left, *right;
};

// Function to create a new node
struct Node* newNode(char data, int freq) {
  struct Node* temp = malloc(sizeof(struct Node));
  temp->data = data;
  temp->freq = freq;
  temp->left = temp->right = NULL;
  return temp;
}

// Code to combine two nodes
struct Node* combineNodes(struct Node* left, struct Node* right) {
  struct Node* parent = newNode('$', left->freq + right->freq);
  parent->left = left;
  parent->right = right;
  return parent;
}

// Usage:
struct Node* n1 = newNode('A', 5);
struct Node* n2 = newNode('B', 9);
struct Node* parent = combineNodes(n1, n2);

printf("Parent freq: %d\n", parent->freq);

What is the output of this code?

medium

A. Parent freq: 5

B. Parent freq: 9

C. Compilation error

D. Parent freq: 14

Solution

1. Step 1: Understand node creation and combination

   n1 has freq 5, n2 has freq 9; combineNodes sums frequencies: 5 + 9 = 14.

2. Step 2: Print parent frequency

   parent->freq is 14, so printf outputs "Parent freq: 14".

3. Final Answer:

   Parent freq: 14 -> Option D

4. Quick Check:

   5 + 9 = 14 frequency sum [OK]

Hint: Sum frequencies when combining nodes for parent freq [OK]

Common Mistakes:

• Printing child node frequency instead of parent
• Forgetting to sum frequencies
• Assuming compilation error due to struct usage

5. You have characters with frequencies: X=3, Y=3, Z=3, W=3. Using Huffman Encoding, what is the minimum total number of bits needed to encode the string "XYZWXYZW" (8 characters)?

hard

A. 12 bits

B. 24 bits

C. 16 bits

D. 8 bits

Solution

1. Step 1: Build Huffman tree for equal frequencies

   All characters have equal frequency (3), so Huffman codes will have equal length, typically 2 bits each (since 4 chars need 2 bits minimum).

2. Step 2: Calculate total bits for 8 characters

   Each character uses 2 bits, total bits = 8 * 2 = 16 bits.

3. Step 3: Re-examine options and problem

   Options include 16 and 24 bits. Since each char is 2 bits, total is 16 bits, but 24 bits is 24 bits. The string length is 8, so 8*2=16 bits is correct.

4. Final Answer:

   16 bits -> Option C

5. Quick Check:

   4 chars need 2 bits each, 8 chars total = 16 bits [OK]

Hint: Equal freq chars get equal length codes; multiply length by count [OK]

Common Mistakes:

• Assuming 1 bit per char incorrectly
• Multiplying frequency instead of code length
• Choosing 24 bits thinking 3 bits per char