Skip to main content

Printing Real number Problem

Given an integer say i of size 32.
Now if i mention a fixed point say 12.
We have to convert/treat above integer to a real number.

So From bit 12....31 will form integer part.
and from 0...11 will be after decimal part.

Now the problem is that we have to print this as real value
without any floating point operation and division operation.

My friend, provided this solution.

for bit 11 -> 5^1 * 10^11 = 500000000000
for bit 10 -> 5^2 * 10^10 = 250000000000
----------
--------
for bit 0 -> 5^11 * 10^0 = ...............(calculate the value)
Add all the above value and print as decimal but after a . char.

Comments

  1. void printfloat ( int number, int loc)
    {
    unsigned int mask = (1 lshift loc)-1;
    int int_part = number rshift loc;
    int i = 1;
    unsigned int value = 0;
    while ( loc-- )
    {
    if ( number & (1 lshift loc))
    {
    value += pow(5,i)*pow(10,loc);
    }
    i++;
    }
    printf("So the number is %u.%u\n",int_part,value);
    }

    ReplyDelete

Post a Comment

Popular posts from this blog

Car Parking Problem

There is n parking slots and n-1 car already parked. Lets say car parked with initial arrangement and we want to make the car to be parked to some other arrangement. Lets say n = 5, inital = free, 3, 4, 1, 2 desired = 1, free, 2, 4 ,3 Give an algorithm with minimum steps needed to get desired arrangement. Told by one of my friend and after a lot of search i really got a nice solution. I will post solution in comment part

Median of Five Numbers

U have 5 NOs , X1,X2,X3,X4,X5 With minimum no. of comparisons we have to find a median. SWAP(X,Y) function is available to u . I have a answer of six comparisons and eight swaps....wait for people to find out by themselves.

Consistent Hashing

I will try to explain consistent hashing with a real world example. Let's assume I have a restaurant with 60 tables and 5 servers (waiter). Each server is given an equal number of tables to serve. Now let's assume we have addition of a new server (waiter), so his addition will be marked in the circle and he will be receiving tables from the previous server to his distance only. Check the attached example. Assume a server (waiter) has left the organisation and we have only 4 servers now. Server3 has left the restaurant, so his table will be assigned to server 4. I am sure you have noticed the load is not equally distributed. But to make the system less prone to addition/removal we just rotate in clockwise and assign range from the previous server to present server.  To make sure load is balanced or optimally balanced we need to use virtual nodes. Check links here: http://tom-e-white.com/2007/11/consistent-hashing.html https://www.toptal.com/big-data/...