Question

In this part, you have to determine the parity of a number and the number of 1-bit pairs present in the number. Parity refers to whether a number contains an even or odd number of 1-bits. 1-bit pairs are defined by two adjacent 1’s without overlap with other pairs. Input format: This program takes a single number as an argument from the command line. This number should be considered as an unsigned short. Output format: Your program should print either “Even-Parity” if the input has an even number of 1 bits and “Odd-Parity” otherwise, followed by a tab. Your program should then print the number of 1-bit pairs present in the number followed by a new line character. Example Execution: $ ./second 12 Even-Parity 1 $ ./second 31 Odd-Parity 2 For example: Number Binary sequence Parity Number of pairs 7 111 Odd 1 15 1111 Even 2 367 101101111 Odd 3

Answer 1

CODE:

#include<iostream>
using namespace std;
int main()
{
unsigned short int n;
cin>>n;
int bin[16];
for(int i=15;i>=0;i--)
{
bin[i]=n%2;
n=n/2;
}
string binary="";
int i;
for(i=0;i<16;i++)
{
if(bin[i]==1)
break;
}
for(int j=i;j<16;j++)
binary+=char(bin[j]+48);
int ones=0;
for(int j=0;j<16;j++)
{
if(bin[j]==1)
ones++;
}
string parity;
if(ones%2==0)
parity="Even";
else
parity="Odd";
int pairs=0;
for(int j=0;j<15;j++)
{
if(bin[j]==1&&bin[j+1]==1)
{
pairs++;
j++;
}
}
cout<<"Number Binary sequence Parity Number of Pairs"<<endl;
cout<<n<<"\t"<<binary<<"\t"<<parity<<"\t"<<pairs<<endl;
return 0;
}