作者koehie (開喜烏龍茶)
看板Grad-ProbAsk
標題[理工] [資結] Huffman code
時間Sat Feb 12 01:34:11 2011
Given the frequency of characters as follows, use Huffman coding the following
problem:
Character A B C D E
Frequency 22 03 10 05 60
(a) Suppose D is known to be encoded as "0001" Show how A, B, C, D and E
are encoded.
A:"01" B:"0000" C:"001" D:"0001" E:"1"
(b) Give two 6-bit sequences of 0's and 1's such that node of them is a valid
encoded message.
98 中央資工 #3
請問這題的(b)在問什麼,有點搞不清楚它到底想問什麼 ? 謝謝。
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 118.233.169.131
※ 編輯: koehie 來自: 118.233.169.131 (02/12 01:34)
推 max1147:你要給兩個合法的6個字元的字串 而且是a能生出來的 02/12 03:55
→ max1147:你題目好像打錯 是問這個樹生不出來的像是111110 02/12 04:04
推 fj91611:打錯了~是none of them 不是node of them 02/12 11:40
→ koehie:嗯,打錯了,謝謝指教。 02/14 18:11