Consider the following two 16-bit floating-point representations 1. Format A There is one sign bit There are k = 7 exponent bits. The exponent bias is 63 (0111111) There are n = 8 fraction/mantissa bits 2. Format B There is one sign bit There are k = 8 exponent bits. The exponent bias is 127 (01111111) There are n = 7 fraction/mantissa bits

In the table, there are some bit patterns given in Format A. Your task is to convert them to the closest value in Format B, and vice versa. If rounding is necessary, you should round toward +. In addition, give the values of numbers given by the Format A and Format B bit patterns. Give these as whole numbers (e.g., 17) or as fractions (e.g., 17/64 or 17/27 or 2 1/8), but NO decimals

In the table in the next page, there are some bit patterns given in Format A. Your task is to convert them to the closest value in Format B, and vice versa. If rounding is necessary, you should round toward to In addition, give the values of numbers given by the Format A and Format B bit patterns. Give these as whole numbers (e.g., 17) or as fractions (e.g., 17/64 or 17/27 or 2 1/8), but NO decimals. Format A Bits 0 1000000 11000000 I Value Format B Bits 0 10000000 1100000 Value 1.1 1 1000001 10011010 1.2 0 1100001 10101010 1.3 0 0100001 11101100 1. 40 1111111 11111111 1 11111111 0000000 1 10000000 1001001 0 11100001 1011101 In the table in the next page, there are some bit patterns given in Format A. Your task is to convert them to the closest value in Format B, and vice versa. If rounding is necessary, you should round toward to In addition, give the values of numbers given by the Format A and Format B bit patterns. Give these as whole numbers (e.g., 17) or as fractions (e.g., 17/64 or 17/27 or 2 1/8), but NO decimals. Format A Bits 0 1000000 11000000 I Value Format B Bits 0 10000000 1100000 Value 1.1 1 1000001 10011010 1.2 0 1100001 10101010 1.3 0 0100001 11101100 1. 40 1111111 11111111 1 11111111 0000000 1 10000000 1001001 0 11100001 1011101