Parity

 bool getParity(unsigned int n)

{

 bool parity = 0;

 while (n)

 {

 parity = !parity;

 n = n & (n - 1);

 }

 return parity;

}


int main()

{

 unsigned int n = 7;

 printf("Parity of no %d = %s", n,

 (getParity(n)? "odd": "even"));

 getchar();

 return 0;

} 

Comments

Post a Comment

Popular posts from this blog

Byte stuffing sending receiving

 #include <stdio.h> int main() {  char data[100],sdata[100],rdata[100],rrdata[100];  int i=0,j=1;  printf ("$ is Flag and @ is Escape Character.\n");  printf ("Enter the Message : ");  scanf ("%s",&data);  sdata[0]='$';  while (data[i]!='\0')  {  if (data[i]=='$'||data[i]=='@')  {  sdata[j]='@';  j++;  sdata[j]=data[i];  }  else  {  sdata[j]=data[i];  }  i++;  j++;  }  sdata[j]='$';  sdata[j+1]='\0';  printf ("Sending data .... %s",sdata);  i=0;  printf ("\n\n");  while (sdata[i]!='\0')  {  rdata[i]=sdata[i];  i++;  }  rdata[i]='\0';  i=0;  for(j=1;rdata[j]!='\0';j++)  {  if (rdata[j]=='@')  {  j++;  rrdata[i]=rdata[j];  }   else if (rdata[j]=='$')  {  rrdata[i]=rdata[j+1];  }  else  {  rrdat...
Read more

Bit stuffing sender

 #include <stdio.h> void main() { char str[100],ptrn[7]="011111",dest[100]; int i,j=0,k=0,c=0; printf ("Flag is 0111110."); printf ("\nEnter The Data : \t"); scanf ("%s",str); while (ptrn[j]!='\0') { dest[k]=ptrn[j]; j++; k++; } dest[k]='1'; k++; dest[k]='0'; k++; j=0; for (i=0;str[i]!='\0';i++) { if (str[i]==ptrn[j]) { dest[k]=str[i]; k++; c++; j++; if (c==6) { dest[k]='0'; c=0; j=0; k++; } } else { dest[k]=str[i]; j=0;c=0; k++; if (str[i]==ptrn[j]) { j++;c++;  } } } j=0; while (j<=5) { dest[k]=ptrn[j]; j++; k++; } dest[k]='1'; k++; dest[k]='0'; dest[k+1]='\0'; printf ("sending Data .... %s",dest); } 
Read more

Ham

#include <math.h> #include <stdio.h> int input[32]; int code[32]; int ham_calc(int, int); void solve(int input[], int); int ham_calc(int position, int c_l) {  int count = 0, i, j;  i = position - 1;    while (i < c_l) {  for (j = i; j < i + position; j++) {  if (code[j] == 1)  count++;  }  i = i + 2 * position;  }  if (count % 2 == 0)  return 0;  else  return 1; } void solve(int input[], int n) {  int i, p_n = 0, c_l, j, k;   i = 0;    while (n > (int)pow(2, i) - (i + 1)) {  p_n++;  i++;  }  c_l = p_n + n;  j = k = 0;    for (i = 0; i < c_l; i++) {    if (i == ((int)pow(2, k) - 1)) {  code[i] = 0;  k++;  }  else {  code[i] = input[j];  j++;  }  }  for (i = 0; i < p_n; i++) {  int position = (int)pow(2, i);  int value = ham_calc(position...
Read more