Explanation of Solution
Function definition for “float_negate()” function:
The implementation for “float_negate()” function is given below:
//Header file
#include <stdio.h>
#include <assert.h>
//Declare the float_bits in unsigned data type
typedef unsigned float_bits;
//Function declaration for float_negate function
float_bits float_negate(float_bits f);
//Function definition for float_negate function
float_bits float_negate(float_bits f)
{
//Compute the value of sign field
unsigned signBit = f >> 31;
//Compute the value of exponent filed
unsigned exponentBit = f >> 23 & 0xFF;
//Compute the value of fraction field
unsigned fractionBit = f & 0x7FFFFF;
//Check if the value of "f" is "NaN" or not
if (exponentBit == 0xFF && fractionBit != 0)
{
/* If "f" is "NaN", then return the given "f" value */
return f;
}
//Otherwise compute the value of "-f"
return (~signBit << 31) | (exponentBit << 23) | fractionBit;
}
//Main function
int main(int argc, char **argv)
{
/* Call function "float_negate" with checking value using "assert" function */
/* For not a number that is "NaN" */
assert(float_negate(0xFFFFFFF8) == 0xFFFFFFF8);
/* For a valid number" */
assert(float_negate(0x10001234) == 0x90001234);
}
The given code is used to compute the value of “-f” that is for floating-point number...
![Check Mark](/static/check-mark.png)
Want to see the full answer?
Check out a sample textbook solution![Blurred answer](/static/blurred-answer.jpg)
Chapter 2 Solutions
COMPUTER SYSTEMS&MOD MSGT/ET SA AC PKG
- I would like to know a brief explanation of basic project management concepts.arrow_forwardEX:[AE00]=fa50h number of ones =1111 1010 0101 0000 Physical address=4AE00h=4000h*10h+AE00h Mov ax,4000 Mov ds,ax; DS=4000h mov ds,4000 X Mov ax,[AE00] ; ax=[ae00]=FA50h Mov cx,10; 16 bit in decimal Mov bl,0 *: Ror ax,1 Jnc ** Inc bl **:Dec cx Jnz * ;LSB⇒CF Cf=1 ; it jump when CF=0, will not jump when CF=1 HW1: rewrite the above example use another wayarrow_forwardEX2: Write a piece of assembly code that can count the number of ones in word stored at 4AE00harrow_forward
- Write a program that simulates a Magic 8 Ball, which is a fortune-telling toy that displays a random response to a yes or no question. In the student sample programs for this book, you will find a text file named 8_ball_responses.txt. The file contains 12 responses, such as “I don’t think so”, “Yes, of course!”, “I’m not sure”, and so forth. The program should read the responses from the file into a list. It should prompt the user to ask a question, then display one of the responses, randomly selected from the list. The program should repeat until the user is ready to quit. Contents of 8_ball_responses.txt: Yes, of course! Without a doubt, yes. You can count on it. For sure! Ask me later. I'm not sure. I can't tell you right now. I'll tell you after my nap. No way! I don't think so. Without a doubt, no. The answer is clearly NO. (You can access the Computer Science Portal at www.pearsonhighered.com/gaddis.)arrow_forwardStart with the initial angles within the integration and just integrate them without mapping them to specific quadrants. Use python and radiansarrow_forwardHow does encryption prevent a hacker from getting your dataarrow_forward
- C++ for Engineers and ScientistsComputer ScienceISBN:9781133187844Author:Bronson, Gary J.Publisher:Course Technology PtrC++ Programming: From Problem Analysis to Program...Computer ScienceISBN:9781337102087Author:D. S. MalikPublisher:Cengage LearningCOMPREHENSIVE MICROSOFT OFFICE 365 EXCEComputer ScienceISBN:9780357392676Author:FREUND, StevenPublisher:CENGAGE L
- Programming Logic & Design ComprehensiveComputer ScienceISBN:9781337669405Author:FARRELLPublisher:CengageEBK JAVA PROGRAMMINGComputer ScienceISBN:9781337671385Author:FARRELLPublisher:CENGAGE LEARNING - CONSIGNMENTMicrosoft Visual C#Computer ScienceISBN:9781337102100Author:Joyce, Farrell.Publisher:Cengage Learning,
![Text book image](https://www.bartleby.com/isbn_cover_images/9781133187844/9781133187844_smallCoverImage.gif)
![Text book image](https://www.bartleby.com/isbn_cover_images/9781337102087/9781337102087_smallCoverImage.gif)
![Text book image](https://www.bartleby.com/isbn_cover_images/9781337671385/9781337671385_smallCoverImage.jpg)
![Text book image](https://www.bartleby.com/isbn_cover_images/9781337102100/9781337102100_smallCoverImage.gif)