Implement character stuffing on given data
Algorithm:
Step 1: Initially give the user 2 choices, whether to character stuff or to directly exit, if wrong choice is entered then prompt an invalid choice message.
Step 2: Intake from the user the number of characters which are to be character stuffed.
Step 3: Then the characters which are to be stuffed are to be taken inside the for loop.
Step 4: Original data is displayed and the characters to be stuffed at the start and end of the frame are uploaded in the program.
Step 5: If DLE character is present then stuff DLE character before it.
Step 6: The characters DLESTX are inserted at the start and end of the data.
Step 7: The data along with the stuffed characters are displayed
Step 8: The original data is recovered and displayed on the receiving side
Step 9: Stop
Program :
#include<stdio.h>
#include<conio.h>
#include<stdlib.h>
void characters(void);
void main()
{
int choice;
while(1
)
{
printf("\n\n\n1.character stuffing");
printf("\n\n2.exit");
printf("\n\n\nenterchoice");
scanf("%d",&choice);
printf("%d",choice);
if(choice>2)
printf("\n\n invalid option ... please renter");
switch(choice)
{
case 1:characters();
break;
case 2: exit(0);
}
}
}
void characters(void)
{
char
c[50],d[50],t[50];
int i,m,j;
printf("enter the number of characters\n");
scanf("%d",&m);
printf("\n enter the characters\n");
for(i=0;i<m+1;i++)
{
scanf("%c",&c[i]);
}
printf("\n original data\n");
for(i=0;i<m+1;i++)
printf("%c",c[i]);d[0]='d';
d[1]='l';d[2]='e';
d[3]='s';d[4]='t'; d[5]='x';
for(i=0,j=6;i<m+1;i++,j++)
{
if((c[i]=='d'&&c[i+1]=='l'&& c[i+2]=='e'))
{
d[j]='d'; j++;
d[j]='l'; j++;
d[j]='e'; j++; m=m+3;
}
d[j]=c[i];
}
m=m+6; m++; d[m]='d'; m++;
d[m]='l'; m++;
d[m]='e'; m++;
d[m]='s'; m++;
d[m]='t'; m++;
d[m]='x';
m++;
printf("\n\n transmitted data: \n");
for(i=0;i<m;i++)
{
printf("%c",d[i]);
}
for(i=6,j=0;i<m-6;i++,j++)
{
if(d[i]=='d'&&d[i+1]=='l'&&d[i+2]=='e'&&d[i+3]=='d'&&d[i+4]=='l'&&d[i+5]=='e')
i=i+3;
t[j]=d[i];
}
printf("\n\nreceived data:");
for(i=0;i<j;i++)
{
printf("%c",t[i]);
}
}
