HomeworkLib
Question

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.

engineering   Computer-Science   
0 0
Add a comment Improve this question Transcribed image text
Next > < Previous
Sort answers by oldest

Homework Answers

Answer #1

Given A:1,B:1, C;2, D:3, E:5, F;8, G:13, Hi21 2.a) Stepi: . stepző steps: step4 ó (12) Step7Final tree to assign o to all left Childs and y to all ought- child cos) assigned into all left Childs and ..o to all Right2.b) 000100100001 000 000 000 1001 : E. f É o c E E Secondl tree of used. So anscer es ..EFRCEF ..

0 0
Add a comment
Know the answer?
Add Answer to:
Consider the following symbols with their corresponding frequencies: A:1, B:1, 0:2, D:3, E:5, F:8, G :...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions

  • 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)?

  • An alphabet contains symbols A, B, C, D, E, F. The frequencies of the symbols are...

    An alphabet contains symbols A, B, C, D, E, F. The frequencies of the symbols are 35%, 20%, 15%, 15%, 8%, and 7%, respectively. We know that the Huffman algorithm always outputs an optimal prefix code. However, this code is not always unique (obviously we can, e.g., switch 0’s and 1’s and get a different code - but, for some inputs, there are two optimal prefix codes that are more substantially different). For the purposes of this exercise, we consider...

  • 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...

  • Problem (A1) (20 points): Huffman Coding Consider a message having the 5 symbols (A,B,C,D,E) with probabilities...

    Problem (A1) (20 points): Huffman Coding Consider a message having the 5 symbols (A,B,C,D,E) with probabilities (0.1,0.1,0.2 ,0.2, 0.4), respectively. For such data, two different sets of Huffman codes can result from a different tie breaking during the construction of the Huffman trees. • Construct the two Huffman trees. (8 points) Construct the Huffman codes for the given symbols for each tree. (4 points) Show that both trees will produce the same average code length. (4 points) For data transmission...

  • 4. Consider the given seven symbols with probabilities as {A, B, C, D, E, F, G}...

    4. Consider the given seven symbols with probabilities as {A, B, C, D, E, F, G} = {0.25, 0.20, 0.18, 0.15, 0.12, 0.06, 0.04}. Use Huffman coding to determine coding bits, entropy and average bits per symbol.

  • 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

  • 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]

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

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

  • 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

  • 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?

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT