ZuoTi.Pro
Question

*7. a. Construct the Huffman tree for the following characters and frequencies: Character      c       d      g      ...

*7. a. Construct the Huffman tree for the following characters and frequencies:

Character      c       d      g       m      r       z

Frequency   28     25       6      20      3      18

b. Find the Huffman codes for these characters.

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

Homework Answers

Answer #1

i am done perfectly anything doubtful or not understand just comment I will touch with you

Please thumsup for my effort

Thank you and all the best

0 0
Add a comment
Know the answer?
Add Answer to:
*7. a. Construct the Huffman tree for the following characters and frequencies: Character      c       d      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

  • You will construct a Huffman tree based on the given frequencies of 26 English alphabets in...

    You will construct a Huffman tree based on the given frequencies of 26 English alphabets in upper case plus the space character. An internal tree node class in HuffmanTree with necessary information is required. • You will not randomly switch left and right children when merger two trees. Instead, you will build a right-heavy tree according to the following strategies to select the right child. (1) The tree that is taller will be the right child, i.e., the height is...

  • Given the following character frequencies from two different input text files, will the associated Huffman tree...

    Given the following character frequencies from two different input text files, will the associated Huffman tree encoding have the same structure (ie. will a have the same bit encoding, b have the same bit encoding, etc). Explain, why or why not. File 1 frequencies: a:4, b:1, c:2, d:5 File 2 frequencies: a:5, b:3, c:4, d:6

  • By applying Huffman’s algorithm construct an optimal binary prefix free code for the following letters A,...

    By applying Huffman’s algorithm construct an optimal binary prefix free code for the following letters A, B, I, M,S,X and Z with their corresponding frequencies. Letter A B I M S X z Frequency 12 7 18 10 9 5 2 Construct Huffman Tree by showing all the necessary (5pt) Give the code-word of each character using the Huffman Tree from (a) (5pt)

  • Write a C++ program which makes a binary tree that generates the Huffman code for any...

    Write a C++ program which makes a binary tree that generates the Huffman code for any 7 characters and their given frequencies. As test input use a 3, b 4, c 1, d 3, e 12, f 4, g 2. Your program must insert nodes, and output the code for each character. Note: your program should be able to take any 7 characters and their frequencies as input. Three extra points if your program can accept 26 letters and 10...

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

  • 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

  • Qu 2: [6 Marks) (a) Information to be transmitted over the internet contains the following characters...

    Qu 2: [6 Marks) (a) Information to be transmitted over the internet contains the following characters with their associated frequencies as shown in the following table: Character abenos tu Frequency 11 6 14 12 3 132 Use Huffman Code Algorithm to answer the following questions: (i) Build the Huffman code tree for the message. (ii) Use the tree to find the codeword for each character. (iii)If the data consists of only these characters, what is the total number of bits...

  • 3. Apply the Huffman algorithm according to the frequency chart shown below. (10 points) a. Show...

    3. Apply the Huffman algorithm according to the frequency chart shown below. (10 points) a. Show your work for combining the characters and frequencies. b. Assemble and show the finished tree. c. State the encoding for each character. d. Show your calculation and state the compression ratio. e. Using your Huffman tree from this question, encode the string ABACABAD. f. Using your Huffman tree from this question, decode the bit-string 100010111001010. symbol A B C D frequency 0.4 0.1 0.2...

  • (a) Create a Huffman code for the following string (whitespace inserted for clarity): AAA BB CCCCC...

    (a) Create a Huffman code for the following string (whitespace inserted for clarity): AAA BB CCCCC CCCCC DD EEE (b) How many bits does your code use to encode the above string? (c) Huffman codes are always optimal prefix codes, and there are many different ways one can build a Huffman code from the same set of character frequencies (e.g. by swapping the left and right subtrees at any iteration). Give an example of an optimal prefix code for this...

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

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
ADVERTISEMENT