Question

Problem 3 [25 pts (4(2,2),6,10,5)]: Information and Entropy An on-line card game uses a deck of 32 cards containing 4 Aces, 8 Kings, 16 Queens, 2 Jacks and 2 Tens. In each round of the game the cards are shuffled, the players make a bet about what type of card will be drawn, then a single card is drawn and the winners are paid off. The drawn card is reinserted into the deck before the next round begins i. How much information does a player receive when she is told that a King has been drawn? ii. What is the average information content received when learning about the outcome of a round iii. Use Huffman's algorithm to create a variable-length prefix-free encoding that minimizes the Which type of card yields the least information? (aka the entropy)? Show your work. expected length of messages reporting the outcome of a sequence of rounds (show the steps in building the tree). Specify your encoding for each of Ace, King, Queen, Jack and Ten. What is the expected length of a message reporting the outcome of 1000 rounds iv. One day there is a strange outage that causes the Queens to be omitted from the deck. Is the entropy reduced or increased? What is now the expected length of a message reporting the outcome of 1000 rounds (conditional on the omission of all Queens)?

Answer 1

ven Noi Queens 6 id told beedalwn whih hq pe No 32 y Kina whele log log,

baboili 2- Given data - -l0q2 / bit ๑nle the Queen Ibujeļded Ibit 米 No pro Qveen 15 32 2 The Droba A 37

H e "Maprting 敁.out bred looo tunls. lema ilg erla one to, libe lebt Fom he Hoffmun al ontn Que 2. kig 너 Pte 8 Ten