Convert the following message to ASCII encoding (using an ASCII table), then calculate the 8-bit checksum for the message: “Down to Basics”.  Show that the checksum from is correct.

Using the Hamming code given in classfor 8 bit data words, determine whether there is an error, and if so, in which bit, for each of the following words fetched from memory: A.0010 0011 0010 B.0110 0011 1010

If an ASCII string has an 8-bit truncated sum of 0x48, what is the value of the checksum byte for the string? Explain your answer.

What is the ASCII representation of the numeral -3.1415 in binary?

For the ASCII string “MTU 1885”, calculate the 2D parity, using even parity throughout. Consult an ASCII table like www.asciitable.com, use 7-bit ASCII codes, and note that the string has 8 characters, including the space.

Extend the ASCII code to 8 bits by adding a 0 to the left of each character and find the bit combinations needed to store the character strings given below. Give your answers in hexadecimal notation. (Caution: Do not overlook the spaces, periods, carriage returns, line feeds extra.) a. CSC 1104 b. Comp_Arch

Note that binary values are in 8 bit two's complement form.

Huffman Coding and Phrases Use the following chart to answer problems 15-19. 15. Calculate the total number of bits per character. Record your answers in the chart. Character Code Frequency Bits A 000 2 E 001 H 010 1 K 011 1 M 100 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.