To return 1 if 'f' is 0.0 or -0.0. Returns 0 otherwise.
To return the +1 if the sign of 'f' is positive, or -1 otherwise.
To return the exponent (the X of 2^X) of the floating point 'f' from 'DENORMALIZED_POWER_OF_2' to 'INFINITE_POWER_OF_2'. To return the mantissa of 'f', with the HIDDEN_BIT or-ed in if 'f' is not denormalized. To return the 0x0 when given +1, or 0x1 when given -1.
To return the exponent field's bit pattern for power of 2 'powerOf2'. If 'powerOf2' is greater or equal to 'INFINITE_POWER_OF_2'
To return the mantissa _field_, 'mantissa' with its hidden bit turned off.
See which has the bigger power-of-2: 'f' or 'g' // Shift the smaller of the two by the difference in power of 2. // Then add the mantissas. // What is the value of 'powerOf2'? What is the value of 'sign'? // How do you detect when the mantissa overflows? // What do you do when the mantissa does overflow?
I have the file that includes everything needed to answer these questions. The file is attached.
This has the requirements and the code written so far. Let me know if you have any other questions.
Ok sounds good.
C programming questions:
Yes I still need an answer. That would be great. Thank you