Answer to Question #159297 in Algorithms for ZULFIQER

Question #159297

As information centers are progressively centered on energy efficiency, it gets to be imperative to create Low control usage of the different applications that run on them. Data or Information compression plays a basic part in information centers to reduce storage capacity and communication costs. This work pivot on building a Low control, High performance execution usage for canonical Huffman encoding.

 

Suppose given Letters I, Q, R, A, C, M, P, U, S with following frequencies.  

           

                                  Frequency Table

                       Character          Frequency     

                               I                         20                  

                                   Q                   11                 

                                   R                     8                    

                                   A                                12                  

                                   C                       49

                                   M                           10

                                    P                            5

                                    U                           5

                                    S                           33

                                                       

A.    Create a Single Huffman tree to determine the Binary codes for each character.

B.    Encode the following secret message sequence using Huffman encoding scheme.

  “IQRACAMPUS”

C.    Compress and encode the given Information using Huffman coding Scheme.

   “STAY HOME STAY SAFE”  

1
Expert's answer
2021-01-29T06:50:20-0500

A.



B.

"I=100, Q=1011, R=0010, A=000, C=11, M=0011, P=10100"

"U=10101, S=01"

"IQRACAMPUS=100" "1011" "0010" "000" "11" "000" "0011" "10100" "10101" "01"


C.


Need a fast expert's response?

Submit order

and get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!

Comments

No comments. Be the first!

Leave a comment

LATEST TUTORIALS
APPROVED BY CLIENTS