Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
My question is :  1 Decode the following 21 bit string and draw the resulting labeled 0-rooted tree. (no justification necessary.) 000 101 110 101 001 000 000   2 This is not an onto encoding. Construct a 21-bit string that is not decodable and explain why it is not decodable.

My question is :  1 Decode the following 21 bit string and draw the resulting labeled 0-rooted tree. (no justification necessary.) 000 101 110 101 001 000 000   2 This is not an onto encoding. Construct a 21-bit string that is not decodable and explain why it is not decodable.

Computer Networking: A Top-Down Approach (7th Edition)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
See similar textbooks
icon
Related questions
Question

My question is : 

1 Decode the following 21 bit string and draw the resulting labeled 0-rooted tree. (no justification necessary.)

000 101 110 101 001 000 000

 

2 This is not an onto encoding. Construct a 21-bit string that is not decodable and explain why it is not decodable.

 

encode this tree into a 21 bit string using the encoding above: (no justification necessary) (5 3
Transcribed Image Text:encode this tree into a 21 bit string using the encoding above: (no justification necessary) (5 3
Encoding. A labeled 0-rooted tree with n vertices is a rooted tree such that each vertex is labeled with the integers {0,...,n – 1} and the root is labeled with 0. Consider the encoding algorithm that encodes a labeled 0-rooted tree with 8 vertices that uses 21 bits. 1. Convert the tree into a list of length 7 where the first entry is the label of the parent of the vertex labeled 1, the second entry is the label of the parent of the vertex labeled 2, and so on. 2. Convert the list into a binary string by encoding each entry as a 3 bit fixed width base 2 integer.
Transcribed Image Text:Encoding. A labeled 0-rooted tree with n vertices is a rooted tree such that each vertex is labeled with the integers {0,...,n – 1} and the root is labeled with 0. Consider the encoding algorithm that encodes a labeled 0-rooted tree with 8 vertices that uses 21 bits. 1. Convert the tree into a list of length 7 where the first entry is the label of the parent of the vertex labeled 1, the second entry is the label of the parent of the vertex labeled 2, and so on. 2. Convert the list into a binary string by encoding each entry as a 3 bit fixed width base 2 integer.
Expert Solution
steps

Step by step

Solved in 4 steps with 1 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY
SEE MORE TEXTBOOKS