PROBLEM 5 Consider the following tree for a prefix code: 1 a 1 e y Figure 13: A tree with 5 vertices. The top vertez branches into character, a, on the left, and a vertez on the right. The verter in the second level branches into character, e, on the left, and a vertez on the right. The vertez in the third level branches into two vertices. The left vertez in the fourth level branches into charac- ter, c, on the left, and character, n, on the right. The right verter in the fourth level branches into character, d, on the left, and character, y, on the right. The weight of each edge branching left from a vertez is 0. The weight of each edge branching right from a verter is 1. (a) Use the tree to encode "day". (b) Use the tree to encode "candy". (c) Use the tree to decode “1110101101". (d) Use the tree to decode "111001101110010".

Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
icon
Related questions
icon
Concept explainers
Question

part a,b,c,d

PROBLEM 5
Consider the following tree for a prefix code:
1
a
1
e
1
y
Figure 13: A tree with 5 vertices. The top vertez branches into character, a,
on the left, and a vertez on the right. The verter in the second level branches into
character, e, on the left, and a vertez on the right. The vertez in the third level
branches into two vertices. The left verter in the fourth level branches into charac-
ter, c, on the left, and character, n, on the right. The right verter in the fourth level
branches into character, d, on the left, and character, y, on the right. The weight
of each edge branching left from a vertez is 0. The weight of each edge branching
right from a verter is 1.
(a) Use the tree to encode "day".
(b) Use the tree to encode "candy".
(c) Use the tree to decode “1110101101".
(d) Use the tree to decode "111001101110010".
Transcribed Image Text:PROBLEM 5 Consider the following tree for a prefix code: 1 a 1 e 1 y Figure 13: A tree with 5 vertices. The top vertez branches into character, a, on the left, and a vertez on the right. The verter in the second level branches into character, e, on the left, and a vertez on the right. The vertez in the third level branches into two vertices. The left verter in the fourth level branches into charac- ter, c, on the left, and character, n, on the right. The right verter in the fourth level branches into character, d, on the left, and character, y, on the right. The weight of each edge branching left from a vertez is 0. The weight of each edge branching right from a verter is 1. (a) Use the tree to encode "day". (b) Use the tree to encode "candy". (c) Use the tree to decode “1110101101". (d) Use the tree to decode "111001101110010".
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 3 images

Blurred answer
Knowledge Booster
Points, Lines and Planes
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, advanced-math and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
Basic Technical Mathematics
Basic Technical Mathematics
Advanced Math
ISBN:
9780134437705
Author:
Washington
Publisher:
PEARSON
Topology
Topology
Advanced Math
ISBN:
9780134689517
Author:
Munkres, James R.
Publisher:
Pearson,