Question

Write code for a function with the following prototype:

// Divide by power of two. Assume 0 <= k < w-1

int divide_power2(int x, int k);

The function should compute x/2 k with correct rounding (round toward 0), and it should follow the bit-level integer coding rules:

• Assumptions

– Integers are represented in twos-complement form.

– Right shifts of signed data are performed arithmetically.

– Data type int is w bits long. For some of the problems, you will be given a specific value for w, but otherwise your code should work as long as w is a multiple of 8. You can use the expression sizeof(int), =).

• Not allowed

– Conditionals (if or ?:), loops, switch statements, function calls, and macro invocations.

– Division, modulus, and multiplication

– Relative comparison operators (, =).

– Casting, either explicit or implicit.

• Allowed operations

– All bit-level and logic operations.

– Left and right shifts, but only with shift amounts between 0 and w − 1.

– Addition and subtraction.

– Equality (==) and inequality (!=) tests. (Some of the problems do not allow these.)

– Integer constants INT_MIN and INT_MAX.

Answer 1

#include <iostream>
#include <cmath>
using namespace std;

int divide_power2(int x, int k)
{
int Z = sizeof(int ) << 3;
/* test sign bit, if negative, then add bias */
(x << (Z - 1)) && (Z += ((1 >> k) - 1));
return x >> k;
}

int main(){
cout<<divide_power2(27,3);
}

CODE SNIP:

IF YOU HAVE ANY QUERY PLEASE COMMENT DOWN BELOW

PLEASE GIVE A THUMBS UP