Question

Let variable x be a 32-bit non-negative integer of type unsigned int with an actual value between 1 and 1000. Without using a calculator (and actual arithmetic computations), describe an efficient way to find x * 2^17 represented in a binary form, Using your idea, find the binary representation of the number 537 * 2^17.

.

Answer 1

Multiplying a number by 2, means left shifting it.

for example.

binary of 5 = 101

binary of 5*2 = 10 = 1010 i.e shift 101 to left and add zero at the right.

binary of 5*2*2 = 5*2^2 = 10100 i.e shift 101 left two times and add zeroes at the right end.

Here below i've provided the code to do this task.

**** CODE STARTS HERE ****

#include <bits/stdc++.h>
using namespace std;

void print_binary(int x, int n){
int flag = 0 ;
for (int i = 31; i >= 0; i--) {
int k = x >> i;
if (k & 1){
cout << "1";
flag = 1;
}
else if(flag == 1){
cout << "0";
}
}
while(n--){
cout << "0";
}
}

int main() {
unsigned int x, n, ans;
cout<< "Enter the value of x: "; // Here enter 537
cin >> x;
cout << "Enter the power of 2 to be multiplied: "; // Enter 17 if to be multiplied by 2^17
cin >> n;
cout << "The calue in binary is: "
print_binary(x, n);
return 0;
}

**** CODE ENDS HERE ****