2- Use bitwise operators to compute division and multiplication by a number that is power of 2. For example: bitwise_divide/multiply(num, 8/16/32/2/4/128) should use only bitwise operators to compute result.
c++ i want part 2 and the rest
1- Given a set of numbers where all elements occur even number of times
except one number, find the odd occurring number” This problem can be
efficiently solved by just doing XOR of all numbers.
2- Use bitwise operators to compute division and multiplication by a number
that is power of 2. For example: bitwise_divide/multiply(num,
8/16/32/2/4/128) should use only bitwise operators to compute result.
3- Write code that checks if a number is odd or even using bitwise operators.
4- Write a program that checks if a number is positive/negative/zero.
5- Write a function that returns toggle case of a string using the bitwise
operators in place.
part1
#include <bits/stdc++.h> // include header file for standard header files
using namespace std;
int fun(int ar[], int size) // start definition of function to check the odd occurences of the numbers
{
int res = 0; // declare the required numbers
for (int i = 0; i < size; i++)
{
res = res ^ ar[i]; // calculate XOR for the numbers
}
return res; // return the value of result
}
int main() // start definition of main function
{
int ar[50], n, res; // declare the required variables
cout<<"Enter size of the array: ";
cin>>n; // take the size of the array from the user
cout<<"Enter element of array: ";
for(int i=0; i<n; i++)
{
cin>>ar[i]; // take element of the array
}
res = fun(ar, n); // call the function
cout<<"The number which occurs odd number of time is: "<<res;
return 0;
}
Step by step
Solved in 3 steps with 2 images
