[8.2] Calculate the product of -8.0546875 × 10° and -1.79931640625 × 10¹ by hand, assuming A and B are stored in the 16-bit half-precision format (1 for sign bit, 5 for exponent, and 10 for fraction). Assume there is a guard, a round bit, and a sticky bit, and use them if necessary. Show all the steps. Indicate if there is overflow or underflow. Write your answer in both the 16-bit floating-point binary format and as a decimal number. How accurate is your result? How does it compare to the number you get if you do the multiplication on a calculator?

6. For an 8-bit operand, specify the 8-bit mask and the logical operator to perform the following operations. Bit positions are numbered 7-0, left to right. a. Logical Operator: Logical Mask: b. Set all bits to 1. Logical Operator: C. Clear bits 5, 4, 3, and 2 to 0. All other bits remain unchanged. Logical Mask: d. Complement bits 2, 1, and O. All other bits remain unchanged. Logical Operator: Logical Mask: Set bits 7, 6, and 5 to 1. All other bits remain unchanged. Logical Operator: Logical Mask:

Question 1. and {C,D} form the two 2-bit numbers N1 and N2. The circuit will perform the difference N1 – N2 and gives output bits F (MSB) and G. Assume that the circuit never sees the combinations of inputs in which N1 is less than N2 i.e. you can regard those input combinations as don't care Consider a 2-bit binary subtractor defined as follows. The inputs {A,B} conditions. а. Fill in the truth table for F and G. b. Fill in the K-map for the minimum sum of products expressions for the function F and G.

[8.4] Using the IEEE 754 floating-point format, write down the bit pattern that would represent -1/4. Can you represent-1/4 exactly?