Consider the following tree for a prefix code: 1 y Figure 13: A tree with 5 vertices. The top verter branches into character, a, on the left, and a verter on the right. The verter in the second level branches into character, e, on the left, and a verter on the right. The verter in the third level branches into two vertices. The left verter in the fourth level branches into charac- ter, e, 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 verter is 0. The weight of each edge branching right from a vertex 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",
Consider the following tree for a prefix code: 1 y Figure 13: A tree with 5 vertices. The top verter branches into character, a, on the left, and a verter on the right. The verter in the second level branches into character, e, on the left, and a verter on the right. The verter in the third level branches into two vertices. The left verter in the fourth level branches into charac- ter, e, 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 verter is 0. The weight of each edge branching right from a vertex 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",
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
Transcribed Image Text:Consider the following tree for a prefix code:
1
y
Figure 13: A tree with 5 vertices. The top verter branches into character, a,
on the left, and a verter on the right. The verter in the second level branches into
character, e, on the left, and a verter on the right. The verter in the third level
branches into two vertices. The left verter in the fourth level branches into charac-
ter, e, 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 verter is 0. The weight of each edge branching
right from a vertex 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
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 4 steps
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education