Question

For a set of n characters, c1, c2, ..., Cn with ck occurring fk times. (wk denotes the length of ck. What is the goal of the Huffman code problem? OA. To minimize Ewklik n k=1 n B. To minimize wkl. k=1 To minimize Efk. k=1 n OD. To maximize Llwxlfk. k=1

Answer 1

Answer:

$(A) ~To~minimize~\sum_{k=1}^{n}|w_{k}|f_{k}$

Explanation:

Goal of the Huffman code problem is to achieve minimum weight path length. Multiplication of weights with frequencies of corresponding characters and summing the values for all of the characters should me minimum. Hence, the above summation represents the actual goal to achieve.