Question - 10 (2 points) Consider a 16 bit floating point number system. The sign bit is the most significant bit. 6 bits are reserved for the exponent and remaining 9 bits are the mantissa. A bias of 31 is to be used. Represent +Infinity in binary using the floating point representation above.
Question - 11 (2 points) Write the assembly language command to add register edx to the contents of memory location addressed by ebx register. Store the result in the memory location pointed by ebx register.
Question - 12 (2 points) Write an assembly language instruction to divide register eex by 64 and store the result in register ecx.
Question - 13 (2 points) Write an assembly language instruction equivalent of the C statement Numbers[i] : $5; Assume in assembly the base Numbers is mapped to register ebx and i is mapped to esi register. Also assume short size variables.
Question - 14 (2 points) is the following statement correct? If not what is wrong with it? movl (%ebx),(%edx)
Question - 15 (2 points) Consider a 16 bit binary number system. Write the binary equivalent of the largest positive number.
This material may consist of step-by-step explanations on how to solve a problem or examples of proper writing, including the use of citations, references, bibliographies, and formatting. This material is made available for the sole purpose of studying and learning - misuse is strictly forbidden.
10. The + infinity has 0 as sign bit (since it is about the positive infinity), the biased-exponent has all bits equal to 1 and the fraction has all bits equal to 0. Hence +infinity represented in the provided format is 0 111111 000000000...
This is only a preview of the solution. Please use the purchase button to see the entire solution