Explanation Given information: t : 0.2, u: 0.3, v: 0.2, w: 0.3. Calculation: First Huffman coding t: 0.2 u: 0.3 v: 0.2 w: 0.3 We have been given 4 symbols. We will then draw a forest of 4 trees containing 1 vertex each, while the vertex has the above names and are labeled with the given values. Now, we observe that t and v have the smallest labels. We will then replace their trees with a new tree that has a root with a left and right child. The edge to the left child is labeled 0 and the edge to the right child is labeled 1. The left child is named t (highest label of the two) and the right child is named v (lowest label of the two). The label of the new tree is the sum of the labels of the trees that were replaced. Now, u and w have the smallest labels. We will then replace their trees with a new tree that has a root with a left and right child. The edge to the left child is labeled 0 and the edge to the right child is labeled 1. The left child is named u (highest label of the two) and the right child is named w (lowest label of the two). The label of the new tree is the sum of the labels of the trees that were replaced. Now, t + v and u + w have the smallest labels. We will then replace their trees with a new tree that has a root with a left and right child. The edge to the left child is labeled 0 and the edge to the right child is labeled 1. The left child is named t + v (highest label of the two) and the right child is named u + w (lowest label of the two). The label of the new tree is the sum of the labels of the trees that were replaced. The encoding of the letters is then the sequence of labels of the edges in the path from the root to the letter...

Discrete Mathematics and Its Applications ( 8th International Edition ) ISBN:9781260091991

8th Edition

ISBN: 9781259676512

Author: Kenneth H Rosen

Publisher: McGraw-Hill Education

See similar textbooks

Videos

Question

Chapter 11.2, Problem 25E

To determine

Construct two different Huffman codes for these symbolsand frequencies: t : 0.2, u: 0.3, v: 0.2, w: 0.3.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Chapter 11.2, Problem 24E

Chapter 11.2, Problem 26E

Students have asked these similar questions

Find the number of unlabeled trees on 6 nodes.

Taylor's baseball team played a full 9-inning game. The team scored 4 runs in every inning, and for every 2 runs it scored, it had 5 hits. What is an appropriate process for finding how many total hits the team had? Make a tree diagram with 1 inning as the starting point. Draw 4 branches to represent the runs. Connect every 2 runs to a single node and draw 5 branches to represent the hits. Multiply the number of hits by 9 to find the number of hits in the full 9-inning game. Make a table with one column for runs and one for hits. Start with 4 runs and 2 hits, then increase each column by 5 for 9 rows to find the number of hits in the full 9-inning game. Make a graph with the number of hits on the x-axis and the number of runs on the y-axis. Start at 0 hits and 0 runs, then add 5 hits for every 4 runs. Continue this pattern 9 times to find the number of hits in the full 9-inning game. Make two tape diagrams, one with 4 rectangles to represent the number of runs, and one with 5…

Draw an ordered stemplot of these scores: 22, 32, 34, 30, 28, 19, 26, 18, 19, 20. List the 'leaves' on the second row in this stemplot in their correct order.

Chapter 11 Solutions

Discrete Mathematics and Its Applications ( 8th International Edition ) ISBN:9781260091991

Ch. 11.1 - Prob. 1E Ch. 11.1 - Vhich of these graphs are trees?Ch. 11.1 - Prob. 3E Ch. 11.1 - Prob. 4E Ch. 11.1 - Prob. 5E Ch. 11.1 - Prob. 6E Ch. 11.1 - Prob. 7E Ch. 11.1 - Prob. 8E Ch. 11.1 - Prob. 9E Ch. 11.1 - Prob. 10E

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, subject and related others by exploring similar questions and additional content below.

Construct two different Huffman codes for these symbolsand frequencies: t : 0.2, u: 0.3, v: 0.2, w: 0.3.

Solution Summary: The author explains how to construct two different Huffman codes for symbols and frequencies.

Videos

Construct two different Huffman codes for these symbolsand frequencies: t : 0.2, u: 0.3, v: 0.2, w: 0.3.

Want to see the full answer?

Chapter 11 Solutions