Derive a Huffman code for the following: a:1, b:1, c:2, d:3, e:5, f:8, g:13.

Question

Question

engineering Computer-Science

Answer 1

Answer #1

Answer 2

Similar Homework Help Questions

Question 1. What is the optimal Huffman code for the following set of characters frequencies? a:1...

Question 1. What is the optimal Huffman code for the following set of characters frequencies? a:1 b:1 c:2 d:3 e:5 f:8 g:13 h:21
Consider the following symbols with their corresponding frequencies: A:1, B:1, 0:2, D:3, E:5, F:8, G :...

Consider the following symbols with their corresponding frequencies: A:1, B:1, 0:2, D:3, E:5, F:8, G : 13, H: 21 Problem 2.a. (3 points) • Construct the Huffman coding of these symbols along with its optimal coding tree. Problem 2.b. (3 points) • Use your coding tree to decode 0001001000010000000001001
Design the optimal (Huffman) code for the alphabet {a, b, c, d, e, f, g, h,...

Design the optimal (Huffman) code for the alphabet {a, b, c, d, e, f, g, h, i, j, k, l}, where frequencies are given in the table below: Draw the appropriate decoding tree. a 0.25 g 0.02 b 0.01 h 0.12 c 0.09 i 0.15 d 0.02 j 0.04 e 0.24 k 0.01 f 0.04 l 0.01

Write a frequency list for A, B,C, D, E, F such that the unique Huffman code for these fre- quencies would correspond to the following tree: B C Write a frequency list for A, B,C, D, E, F such t...

Write a frequency list for A, B,C, D, E, F such that the unique Huffman code for these fre- quencies would correspond to the following tree: B C Write a frequency list for A, B,C, D, E, F such that the unique Huffman code for these fre- quencies would correspond to the following tree: B C
We have the symbols A, B, C, D, E, F, G, H with frequencies 1, 1,...

We have the symbols A, B, C, D, E, F, G, H with frequencies 1, 1, 2, 4, 8, 16, 32, 64. Show the Huffman tree and Huffman code for the symbols. How much compression does a 1000 digit file use when using this Huffman code based on an 8-bit ASCII code (ie, ISO 8859-1)?
Problem (3): Huffman Coding A message contains n = 5 symbols (A, B, C, D, E)...

Problem (3): Huffman Coding A message contains n = 5 symbols (A, B, C, D, E) with probabilities P = (1/2, 1/4, 1/8, 1/16, 1/16), respectively. • Find a variable length Huffman coding for the 5 symbols • Find the average code length < L > for the obtained codes • Show that < L > can also be obtained by summing the probabilities of the internal nodes in the Huffman tree. • Find the coding efficiency for the obtained...

Write a frequency list for A, B,C, D, E, F such that the unique Huffman code for these fre- quencies would correspond t...

Write a frequency list for A, B,C, D, E, F such that the unique Huffman code for these fre- quencies would correspond to the following tree: B C Write a frequency list for A, B,C, D, E, F such that the unique Huffman code for these fre- quencies would correspond to the following tree: B C
5. Eight letters {A, B, C, D, E, F,G,H} appear in a 100 letter length message...

5. Eight letters {A, B, C, D, E, F,G,H} appear in a 100 letter length message with the following frequencies: 22, 6, 13, 19, 2, 9, 25, 4. (a) Use Huffman tree to design an optimal binary prefix code for the letters. (b) What is the average bit length of the message after apply codes designed in (a) to the message? [20 marks]
Write the code to implement the expression A (((B C)/D) *(E F) *G) on 3-, 2-, 1-, and 0- address ...

Write the code to implement the expression A (((B C)/D) *(E F) *G) on 3-, 2-, 1-, and 0- address machines. Do not rearrange the expression. In accordance with programming language practice, computing the expression should not change the values of its operands. When working with 0-address instructions, assume that the operation is TOS-SOS OP TOS. Write the code to implement the expression A (((B C)/D) *(E F) *G) on 3-, 2-, 1-, and 0- address machines. Do not rearrange...

A long string consists of the six characters A, B, C, D, E, F, G; they...

A long string consists of the six characters A, B, C, D, E, F, G; they appear with frequency 21%, 11%, 8%, 17%, 5%, 23%, and 15%, respectively. (a) Draw the Huffman encoding tree of these six characters. (b) What is the Huffman encoding of these six characters? (c) If this encoding is applied to a string consisting of one million characters with the given frequencies, what is the length of the encoded string in bits?