2. In a data file there are ten thousand characters of the following like in the picture. betty batter bought butter, the butter was not bitter butter, but the better butter. No newline is there but check for the punctuation sign. Answer the following: (a). If you convert the characters in the binary sequence of 0, and 1 using ASCII fixed-length code then what will be the total number of bits? (b) Can you have lesser number of total bits using fixed-length code than part (a)? (c) 'Step by Step' shows the Huffman tree for this case and figure out the codewords? [ each step needs to be shown] (d) Prove the all the codewords are optimal and prefix code (e) Calculate how much data was compressed in Huffman that part (a) and part (b) individually. [Please see carefully, and do not forget any character] (f) Calculate the efficiency of Huffman coding from part (a) and part (b)? Explain it as well.
2. In a data file there are ten thousand characters of the following like in the picture. betty batter bought butter, the butter was not bitter butter, but the better butter. No newline is there but check for the punctuation sign. Answer the following: (a). If you convert the characters in the binary sequence of 0, and 1 using ASCII fixed-length code then what will be the total number of bits? (b) Can you have lesser number of total bits using fixed-length code than part (a)? (c) 'Step by Step' shows the Huffman tree for this case and figure out the codewords? [ each step needs to be shown] (d) Prove the all the codewords are optimal and prefix code (e) Calculate how much data was compressed in Huffman that part (a) and part (b) individually. [Please see carefully, and do not forget any character] (f) Calculate the efficiency of Huffman coding from part (a) and part (b)? Explain it as well.
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...
Related questions
Question
kindly solve sub part d, e and f elaborately showing proper explanation step by step in details with huffman coding
Thank you
![2. In a data file there are ten thousand characters of the following like
in the picture.
betty batter bought butter, the butter was not bitter butter, but the
better butter.
No newline is there but check for the punctuation sign. Answer the
following:
(a). If you convert the characters in the binary sequence of 0, and 1
using ASCII fixed-length code then what will be the total number of
bits?
(b) Can you have lesser number of total bits using fixed-length code
than part (a)?
(c) 'Step by Step' shows the Huffman tree for this case and figure out
the codewords? [ each step needs to be shown]
(d) Prove the all the codewords are optimal and prefix code
(e) Calculate how much data was compressed in Huffman that part (a)
and part (b) individually. [Please see carefully, and do not forget any
character]
(f) Calculate the efficiency of Huffman coding from part (a) and part
(b)? Explain it as well.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F56b641d3-5ed7-40fe-81c3-f91b3cf50c64%2Fd7d9ead0-ae76-41b2-b9aa-fba1fa3fd092%2F8a4rqhr_processed.png&w=3840&q=75)
Transcribed Image Text:2. In a data file there are ten thousand characters of the following like
in the picture.
betty batter bought butter, the butter was not bitter butter, but the
better butter.
No newline is there but check for the punctuation sign. Answer the
following:
(a). If you convert the characters in the binary sequence of 0, and 1
using ASCII fixed-length code then what will be the total number of
bits?
(b) Can you have lesser number of total bits using fixed-length code
than part (a)?
(c) 'Step by Step' shows the Huffman tree for this case and figure out
the codewords? [ each step needs to be shown]
(d) Prove the all the codewords are optimal and prefix code
(e) Calculate how much data was compressed in Huffman that part (a)
and part (b) individually. [Please see carefully, and do not forget any
character]
(f) Calculate the efficiency of Huffman coding from part (a) and part
(b)? Explain it as well.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps
Recommended textbooks for you
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 Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
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 Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
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
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY