Huffman Coding

Huffman coding is used for:

• Compression

• Encryption

• Error detection

• Error correction

Huffman coding is based on which algorithmic technique?

• Dynamic Programming

• Greedy Algorithm

• Divide and Conquer

• Backtracking

In Huffman coding, the characters with higher frequencies have:

• Longer codes

• Shorter codes

• Fixed-length codes

• Random-length codes

What is the time complexity of constructing a Huffman tree using a priority queue?

• O(n log n)

• O(n²)

• O(n log log n)

• O(n)

In Huffman coding, the resulting code is:

• Fixed-length and Prefix-free

• Variable-length but not unique

• Fixed-length

• Prefix-free

What type of data structure is used to build the Huffman tree?

• Stack

• Queue

• Binary Heap (Priority Queue)

• Linked List

Huffman coding is an example of:

• Lossless compression

• Lossy compression

• Hybrid compression

• None of the above

Which of the following is true about Huffman coding?

• It always results in fixed-length codes

• It may have ambiguity in decoding

• It generates optimal prefix codes

• It can’t be used for text compression

Huffman coding assigns shorter codes to characters that occur:

• Less frequently

• More frequently

• Equally frequently

• Randomly

If a file has N distinct characters, how many leaf nodes will the Huffman tree have?

• N

• 2N

• N - 1

• N + 1