Program for Bit Stuffing

12 Responses to “Program for Bit Stuffing”

1. soumya says:

   February 21, 2011 at 9:49 pm

   after for loop plz initilize the count to 1.the it will work for any number of bits having
   5 continuous 1′s
2. soumya says:

   February 21, 2011 at 9:49 pm

   after for loop plz initilize the count to 1.the it will work for any number of bits having
   5 continuous 1′s…………
3. Harsh says:

   February 23, 2011 at 8:03 pm

   in the bit stuffing program put count=0,then it will run correctly,i.e.it will put 0 after 011111
4. Mohan says:

   April 10, 2011 at 4:24 am

   Thanku darling
5. pawan says:

   December 22, 2011 at 3:26 pm

   the code is not showing the correct result for string length greater then 10
6. abcd says:

   January 24, 2012 at 10:00 am

   Chosen by Asker
   #include
   #include

   void main()
   {
   char num[11], i, j, k, cnt=0;
   clrscr();
   printf(“Enter the sequence of 10 digit binary numbers: “);
   for(i=0;i<10;i++)
   scanf("%c", &num[i]);
   printf("The 10 digit binary number you have entered is: ");
   for(i=0;i<10;i++)
   printf("%c", num[i]);
   printf("\nAfter stuffing: ");
   i=0;
   while (ii;k–)
   num[k]=num[k-1];
   num[i]=0;
   num[i]=’0′;
   }
   }
   else
   {
   i++;
   cnt=0;
   }
   }
   for(i=0;i<11;i++)
   printf("%c", num[i]);
   printf("\nAfter destuffing: ");
   i=0;
   while (i<10)
   {
   if(num[i]=='1')
   {
   i++;
   cnt++;
   if(cnt==5)
   {
   for(k=i;k<11;k++)
   num[k]=num[k+1];
   }
   }
   else
   {
   i++;
   cnt=0;
   }
   }
   for(i=0;i<10;i++)
   printf("%d", num[i]-48);
   getch();
7. jay says:

   April 12, 2012 at 10:07 pm

   #include
   #include
   #include
   #include
   #include
   #include “myheader.h”
   int main()
   {
   char str1[50],str2[50];
   int i=0,j=0,len,count=0;
   int open_status,mknod_status;

   printf(“Enter The String : “);
   scanf(“%s”,str1);
   len=strlen(str1);

   printf(“Displaying Bit Values :\n”);
   for(i=0;i<len;i++)
   {
   printf("Bit Values For %c : ",str1[i]);
   displaybit(str1[i]);
   printf("\n");
   }

   printf("\nReplacing bit :\n");

   for(i=0;i<len;i++)
   {
   for(j=0;j<=7;j++)
   {
   if((getbit(str1[i],j)==1))
   {
   count++;
   }
   if(count==5)
   {
   insertbit(count+1,str1[j],0);
   count=0;
   }
   //count++;
   }
   }

   printf("Displaying Bit Values After Changing bit :\n");
   for(i=0;i<len;i++)
   {
   printf("Bit Values For %c : ",str1[i]);
   displaybit(str1[i]);
   printf("\n");
   }

   str2[0]='~';
   for(i=1;i<len;i++)
   {
   str2[i]=str1[i-1];
   }
   str2[i]='~';
   len=strlen(str2);
   for(i=0;i<len;i++)
   {
   printf("Character Bit : %c \n",str2[i]);
   }

   printf("\nNew String: %s",str2);

   mknod_status=mknod("pipe",S_IFIFO|S_IRWXU,0);

   if(mknod_status<0)
   {
   printf("error in pipe ");

   }
   open_status=open("pipe",O_WRONLY);
   if(open_status<0)
   {
   printf("error in open ");

   }
   write(open_status,str2,sizeof(str2));

   close(open_status);
   return 0;
   }
8. k.Arunkumar says:

   June 15, 2012 at 12:14 pm

   coding is too lengthy
9. dfghdf says:

   September 21, 2012 at 4:38 pm

   abe ye kya gandu program h
10. rima says:

    October 5, 2012 at 11:20 am

    ….
11. ambica says:

    October 17, 2012 at 10:33 pm

    i want alogrithm for this program
12. vikas says:

    May 2, 2013 at 3:26 pm

    11110

Leave a Reply