Question

problem 1

midterm-1-coding.pdf C:/Users/Cute%20khalsa/Downloads/midterm-1-coding.pdf 2 Problem #1 The first problem is to write the from.fixed point function, using "bit fiddling". double from_fixed point(unsigned short x); The parameter x is a representation (sometimes called a packed representation) of a fixed- point number. The right most 4 bits of x are the fractional part of the number. We will call them b. The leftmost 12 (or more) bits of x are the integer part of the number. We will call them a Consider a hypothetical value 0x28 for x, represented in 16-bit binary as: 0 0 0 0 0 0 0 0 0 0 1 0 1 0 0 0 The leftmost 12 bits (@) have the value of 2. The right most 4 bits (6) have a value of 8. To turn x into a double the formula is a + . You will always divide the fractional part by 16, as a double In this example, where a is 2 and bis 8, you should return the number 2.5 (because 2+ = 2.5). The general step-by-step guide to writing this function is: 1. Isolate the right most 4 bits of 2. Isolate the leftmont 12+ bits (everything creept the right most I bits) or 3. Divide by 16 and then add together

Answer 1

Program

#include<stdio.h>

//function from_fixed_point
double from_fixed_point(unsigned short x)
{
unsigned short a, b;
double c;
//isolated rightmost 4 bits
b = x & 0xf;
//isolated leftmost 12+ bits
a = x >> 4;
//divide by 16 and then add together
c = a + (double)b/16;
//return the double value
return c;
}

//main function
int main(void)
{
unsigned short x = 0x28;

double y = from_fixed_point(x);

printf("%f", y);
}

Output:

2.500000

N.B. Whether you face any problem or need any modification then share with me in the comment section, I'll happy to help you.