We set the symbol generator from the previous question running, generate 100 symbols and collect the bits generated by the Huffman coder to represent those symbols. What is the smallest number of bits that could result? (Type a number only - no units.)

Suppose that the output of a process that generates independent symbols {A, B, C, D, E} with known probabilities {in the same order: 0.2, 0.33, 0.1, 0.07, 0.3 } needs to be communicated. If we constructed a Huffman code to represent the symbols, what would be the average number of binary digits/symbol that would result? (Your answer should be accurate up to the first decimal point. Type a number only - no units.)

The following Message "B C C A B B D D A E C C B B A E D D C C", is given. Use Huffman algorithm to find the total size of the message 1 point43 bits45 bits40 bits41 bits

A text is made up of the characters a, b, c, d, e each occurring with the probability 0.11, 0.40, 0.16, 0.09 and 0.24, respectively. The optimal Huffman coding technique will have the average length of:a.2.15b.2.26c.2.40d.2.16

Consider the following sentence (you don’t need to consider the spaces betweencharacters).“MADAM I AM ADAM”1. Assume that 8-bit extended ASCII encoding is used to represent the above sentence.Find out how many bytes are required to represent the above sentence.2. What is the minimum/optimum number of bits needed to represent the abovesentence?3. Calculate the number of bits that are necessary to represent the above sentence usingHuffman encoding.4. Using Huffman encoding how would you represent the following sequence ofcharacters? “DAMMA”

What is the smallest unit of digital memory used to code a single character (letter, number, or symbol)?