How many eight-bit binary strings contain exactly 3 1s? How many eight-bit binary strings contain at least three 1s? How many eight-bit binary strings contain an equal number of 0s and 1s?  How many eight-bit binary strings contain at most three 1s?

1. Generate the Hamming-code for the following 12-bit data string : 1 0 1 0 1 1 0 1 1 1 0 1 Show that the generated binary string does not have any errors.

How many length eight binary strings (strings with eight characters, each of which is “0” or “1”)start with “111”? How many length eight binary strings contain exactly one zero?

Calculate the total number of bits per character. Record your answers in the chart. Character Code Frequency Bits А 000 2 E 001 H 010 1 K 011 1 М 100 3 101 1 R 110 2 S 111 1 T 1000 4 U 1001 1 space 1010 4 What are the total bits in the original code? Use Huffman Coding to compress the following phrase: "MEET ME AT THE SUPERMARKET". Draw the Huffman Coding tree in the space provided below. Hint: You can use the Shape tool to draw the graph, or you can draw the graph by hand, then photograph or scan your graph to submit it.