Assume we are using the simple model for floating-point representation as given in the textbook (the representation uses a 14-bit format, 5 bits for the exponent with a bias of 15, a normalized significand of 8 bits, and one bit for the sign of the number).

a) Find the representations of 0.24 and 0.12 in this floating-point format. Show your work including the multiplication algorithm to convert the given fractional numbers to binary.

b) What are the absolute and relative errors in computing 0.24+0.12 (i.e., add the numbers using the floating-point addition algorithm and compare with the expected result of 0.36).

3. Given the function: F(x,y,z)= x'y' + x'z + yz' + y'z

a) (5 pts) Write the truth table for F

b) (5 pts) Draw the logic diagram using the original Boolean expression

c) (5 pts) Simplify the expression using Boolean Identities

d) (5 pts) Simplify the expression using K-Maps

computer architecture

I need both questions. Yes, i would like for the rest to be answered in the comment section. Thank you

2. Assume we are using the simple model for floating-point representation as given in the textbook (the representation uses a 14-bit format, 5 bits for the exponent with a bias of 15, a normalized significand of 8 bits, and one bit for the sign of the number). a) Find the representations of 0.24 and 0.12 in this floating-point format. Show your work including the multiplication algorithm to convert the given fractional numbers to binary. b) What are the absolute and relative errors in computing 0.24+0.12 (i.e., add the numbers using the floating-point addition algorithm and compare with the expected result of 0.36). 3. Given the function: F(x,y,z)=x'y' + x'z + yz' + y'z a) (5 pts) Write the truth table for F b) (5 pts) Draw the logic diagram using the original Boolean expression c) (5 pts) Simplify the expression using Boolean Identities d) (5 pts) Simplify the expression using K-Maps