ode of the following bitstream using even parity. 110111110101110101011

Please do the following binary addition;

Questión Use Huffman coding to compress the letters in the following chart. What are the total bits of the compressed code? Code 000 001 010 011 100 Frequency 12 14 11 3 Character A Total Bits 36 В 42 C 33 6. 15 D E F N 101 110 13 39 1 3 a 177 bits b 151 bits 174 bits d 163 bits

2. Convert each of the following binary numbers to its 2s-Complement Signed Binary representation: Binary 0000 0110 0010 1100 0000 1110 0011 0110 0000 0001 1011 1110 2s-Complement

IEEE 754-2008 contains a half precision that is only 16 bits wide. The leftmost bit is still the sign bit, the exponent is 5 bits wide and has a bias of 15, and the mantissa is 10 bits long. A hidden 1 is assumed. Write down the bit pattern to represent -1.5625 * 10-2 assuming a version of this format. Calculate the sum of 2.6125*102 and 4.150390625 * 10-1 by hand,assuming both numbers are stored in the 16-bit half precision described above. Assume 1 guard, 1 round bit, and 1 sticky bit, and round to the nearest even. Show all the steps.

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.  011110.10101 100110.10110

Match all equal values V V 1100110 14510 22210 #6D19A 1. 10010001 2. #DE 3. 01101101000110011010 4. 10210

What are the 16-bit 1’s and 2’s complements of the following binarynumbers? Number is - 0100111000100100

Add the following signed 5-bit 2's complement binary numbers and convert the sum to a decimal (bose ten) numbe a) e0111 + 00011 this sum in base ten: b) 11101 + 00011 this sum in base ten: c) 10001 + 10001 this sum in base ten: d) 10000 + 100ee this sum in base ten: e) 10101 + 01010 this sum in base ten: LLL

Add the following two binary words and find the sum and carry bit: A = 1100 _ 0101 , B = 1010 _ 1010.