Construct a huffman code for the letters of the english alphabet where the frequ

Question

Construct a huffman code for the letters of the english alphabet where the frequencies of letters in a typical english text are shown in this table Letter Freq Letter Freq a 0.0817 n 0.0662 b 0.0145 o 0.0781 c 0.0248 p 0.0156 d 0.0431 q 0.0009 e 0.1232 r 0.0572 f 0.0209 s 0.0628 g 0.0182 t 0.0905 h 0.0668 u 0.0304 i 0.0689 v 0.0102 j 0.0010 w 0.0264 k 0.0080 x 0.0015 l 0.0397 y 0.0211 m 0.0277 z 0.0005 Suppose that m is a postitive integer with m > 2. An m-ary huffman code fir a set of N symbols can be constructed analogously to the construction of a binary huffman code. At the inital step, ((n-1) mod (m -1)) +1 trees consisting of a single vertex with at least weights are combined into a rooted tree with these vertices as leaves. At each subsequent step, the m trees of least weight are combined into an m-ary tree

Explanation / Answer

i think there is something missing in this question. please recheck and post it again

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

---