You have to perform the following subtraction in 2's complement form 29 - 75 (base 10). How many bits are required to represent each number in binary to perform subtraction in 2'scomplement? Perform the subtraction and show the result in decimal.

Add binary numbers 100111 and 11011 in both decimal and binary forms.

There are multiple schemes that can be used to represent integers in binary, including 1. Assuming that we use 12 bits to represent a number in two's complement scheme, answer the following questions: (a) What are the largest and smallest integers that can be represented? (b) How many different values can be represented? (c) How to represent 2710? (d) How to represent -4510 if supported?

Different ways of representing integers in a binary format exists like the sign magnitude and the One’s complement. Why the sign magnitude is almost neither used in practice?

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.

Convert the following two’s complement binary fixed-point numbers to base 10. The implied binary point is explicitly shown to aid in your interpretation. (Note: You should show all steps) 0110.1011 1111.1111

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.