Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
Please slove only sub part    a    and b in detailed not just any copied answer from google . PLease show proper explanation and calculation  Thank you !!

Please slove only sub part    a    and b in detailed not just any copied answer from google . PLease show proper explanation and calculation  Thank you !!

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

Please slove only sub part    a    and b in detailed not just any copied answer from google . PLease show proper explanation and calculation 

Thank you !!

Question -3. Q. In a data file there are ten thousand characters of the following like in the picture. abraaaa kaa dabbrraaaaal!! No newline character is there. part- (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 less 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 (d) Calculate how much data was compressed in Huffman that part (a) and part (b) individually. [Please see carefully, and do not forget any character] abraaaa kaa dabbrraaaaa!!! Your answer
Transcribed Image Text:Question -3. Q. In a data file there are ten thousand characters of the following like in the picture. abraaaa kaa dabbrraaaaal!! No newline character is there. part- (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 less 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 (d) Calculate how much data was compressed in Huffman that part (a) and part (b) individually. [Please see carefully, and do not forget any character] abraaaa kaa dabbrraaaaa!!! Your answer
Expert Solution
steps

Step by step

Solved in 2 steps

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