0% found this document useful (0 votes)

42 views39 pages

Kit DCN Program

The document describes 5 programs that implement different data communication network (DCN) encoding/decoding techniques: 1. Bit stuffing - Adds a 0 bit after every sequence of 5 consecutive 1 bits to ensure sufficient transition for clock synchronization. 2. Character count - Replaces characters with the count of characters since the last space. 3. Character stuffing - Replaces certain character sequences like "dle" with an alternate encoded sequence to ensure sufficient transition. 4. The programs demonstrate how data can be encoded for transmission and decoded back to the original form using techniques like bit stuffing, character counting and character stuffing.

Uploaded by

Dhanraj chavan

We take content rights seriously. If you suspect this is your content, claim it here.

Available Formats

Download as PDF, TXT or read online on Scribd

0% found this document useful (0 votes)

42 views39 pages

Kit DCN Program

Uploaded by

Dhanraj chavan

We take content rights seriously. If you suspect this is your content, claim it here.

Available Formats

Download as PDF, TXT or read online on Scribd

You are on page 1/ 39

DCN Programs

1.Bit stuffing -1
#include<stdio.h>

int main()

char msg1[2000], msg2[2000], msg3[2000];

int i=0, j=0;

printf("\n Enter frame(0's and 1's): ");

scanf("%s",msg1);

while(i<strlen(msg1))

if(msg1[i]=='1' && msg1[i+1]=='1' && msg1[i+2]=='1' && msg1[i+3]=='1' && msg1[i+4]=='1')

msg2[j]='1';

msg2[j+1]='1';

msg2[j+2]='1';

msg2[j+3]='1';

msg2[j+4]='1';

msg2[j+5]='0';

j=j+6;

i=i+5;

else

msg2[j]=msg1[i];
i++;

j++;

msg2[j]='\0';

printf("\n\n Original Data is : %s", msg1);

printf("\n\n Stuffed Data is : %s", msg2);

i=0,j=0;

while(i<strlen(msg2))

if(msg2[i]=='1' && msg2[i+1]=='1' && msg2[i+2]=='1' && msg2[i+3]=='1' && msg2[i+4]=='1'

&& msg2[i+5]=='0')

msg3[j]='1';

msg3[j+1]='1';

msg3[j+2]='1';

msg3[j+3]='1';

msg3[j+4]='1';

j=j+5;

i=i+6;

else

msg3[j]=msg2[i];

i++;

j++;

}
msg3[j]='\0';

printf("\n\n Destuffed msg is : %s", msg3);

printf("\n\n\n ");

return 0;

Output:

Enter frame(0's and 1's): 011110111101111110110

Original Data is : 011110111101111110110

Stuffed Data is : 0111101111011111010110

Destuffed msg is : 011110111101111110110

--------------------------------------------------------------------------------------------------------------------------

2. Bit stuffing 2
#include<stdio.h>

#include<string.h>

int main()

char msg1[2000], msg2[2000], msg3[2000],temp[2000];

char flag[]="01111110";

int i=0, j=0;

printf("\n Enter frame(0's and 1's): ");

scanf("%s",msg1);

while(i<strlen(msg1))

if(msg1[i]=='0' && msg1[i+1]=='1' && msg1[i+2]=='1' && msg1[i+3]=='1' && msg1[i+4]=='1'

&& msg1[i+5]=='1' && msg1[i+6]=='1' && msg1[i+7]=='0')

msg2[j]='0';
msg2[j+1]='1';

msg2[j+2]='1';

msg2[j+3]='1';

msg2[j+4]='1';

msg2[j+5]='1';

msg2[j+6]='0';

msg2[j+7]='1';

msg2[j+8]='0';

j=j+8;

i=i+7;

else

msg2[j]=msg1[i];

i++;

j++;

msg2[j]='\0';

strcat(msg2,flag);

strcat(temp,flag);

strcat(temp,msg2);

strcpy(msg2,temp);

printf("\n\n Original Data is : %s", msg1);

printf("\n\n Stuffed Data is : %s", msg2);

i=8,j=0;
while(i<strlen(msg2)-8)

if(msg2[i]=='0' && msg2[i+1]=='1' && msg2[i+2]=='1' && msg2[i+3]=='1' && msg2[i+4]=='1'

&& msg2[i+5]=='1' && msg2[i+6]=='0' && msg2[i+7]=='1' && msg2[i+8]=='0')

msg3[j]='0';

msg3[j+1]='1';

msg3[j+2]='1';

msg3[j+3]='1';

msg3[j+4]='1';

msg3[j+5]='1';

msg3[j+6]='1';

msg3[j+7]='0';

j=j+7;

i=i+8;

else

msg3[j]=msg2[i];

i++;

j++;

msg3[j]='\0';

printf("\n\n Destuffed msg is : %s", msg3);

printf("\n\n\n ");

return 0;

}
Output:

Enter frame(0's and 1's): 0111101111101111110

Original Data is : 0111101111101111110

Stuffed Data is : 011111100111101111101111101001111110

Destuffed msg is : 0111101111101111110

3. Character count:
#include<stdio.h>

int main()

char msg1[50], msg2[50];

int i, j, cnt=0;

char z;

printf("\n Enter Message: ");

gets(msg1);

for(i=j=0; ; )

if(msg1[i] == ' ')

z=48+cnt+1;

msg2[i-cnt] = z;

i++;

j++;

cnt = 0;

else if(msg1[i] == '\0')

{
z=48+cnt+1;

msg2[i-cnt] = z;

i++;

j++;

cnt = 0;

break;

else

msg2[j+1] = msg1[i];

i++;

j++;

cnt++;

msg2[j]='\0';

printf("\n\n Original Data is : %s", msg1);

printf("\n\n Stuffed Data is : %s", msg2);

printf("\n\n\n ");

return 0;

Output:

Enter Message: Shailesh Mohite

Original Data is : Shailesh Mohite

Stuffed Data is : 9Shailesh7Mohite

--------------------------------------------------------------------------------------------------------------------------------------
4. Character Stuffing-1
#include<stdio.h>

int main()

char msg1[2000], msg2[2000], msg3[2000];

int i=0, j=0;

printf("\n Enter data: ");

scanf("%s",msg1);

strcpy(msg2,"dlestx");

j=j+6;

while(i<strlen(msg1))

if(msg1[i]=='d' && msg1[i+1]=='l' && msg1[i+2]=='e')

msg2[j]='d';

msg2[j+1]='l';

msg2[j+2]='e';

msg2[j+3]='d';

msg2[j+4]='l';

msg2[j+5]='e';

j=j+6;

i=i+3;

else

{
msg2[j]=msg1[i];

i++;

j++;

msg2[j]='d';

msg2[j+1]='l';

msg2[j+2]='e';

msg2[j+3]='e';

msg2[j+4]='t';

msg2[j+5]='x';

msg2[j+6]='\0';

printf("\n\n Original Data is : %s", msg1);

printf("\n\n Stuffed Data is : %s", msg2);

i=6,j=0;

while(i<strlen(msg2)-6)

if(msg2[i]=='d' && msg2[i+1]=='l' && msg2[i+2]=='e' && msg2[i+3]=='d' &&

msg2[i+4]=='l' && msg2[i+5]=='e')

msg3[j]='d';

msg3[j+1]='l';

msg3[j+2]='e';

i=i+6;

j=j+3;

else
{

msg3[j]=msg2[i];

i++;

j++;

msg2[j+1]='\0';

printf("\n\n Destuffed msg is : %s", msg3);

printf("\n\n\n ");

return 0;

Output:

Enter data: kitcoek

Original Data is : kitcoek

Stuffed Data is : dlestxkitcoekdleetx

Destuffed msg is : kitcoek

5. Character Stuffing -2
#include<stdio.h>

int main()

char msg1[2000], msg2[2000], msg3[2000];

char sd[]="#*";

char ed[]="#@";

int i=0, j=0;

printf("\n Enter data: ");

scanf("%s",msg1);
msg2[j]='#';

msg2[j+1]='*';

j=j+2;

while(i<strlen(msg1))

if(msg1[i]=='#' && msg1[i+1]=='*')

msg2[j]='#';

msg2[j+1]='#';

msg2[j+2]='*';

i=i+2;

j=j+3;

else if(msg1[i]=='#' && msg1[i+1]=='@')

msg2[j]='#';

msg2[j+1]='#';

msg2[j+2]='@';

i=i+2;

j=j+3;

else

msg2[j]=msg1[i];

i++;

j++;
}

msg2[j]='#';

msg2[j+1]='@';

msg2[j+2]='\0';

printf("\n\n Original Data is : %s", msg1);

printf("\n\n Stuffed Data is : %s", msg2);

i=2,j=0;

while(i<strlen(msg2)-2)

if(msg2[i]=='#' && msg2[i+1]=='#' && msg2[i+2]=='*')

msg3[j]='#';

msg3[j+1]='*';

i=i+3;

j=j+2;

else if(msg2[i]=='#' && msg2[i+1]=='#' && msg2[i+2]=='@')

msg3[j]='#';

msg3[j+1]='@';

i=i+3;

j=j+2;

}
else

msg3[j]=msg2[i];

i++;

j++;

msg2[j+1]='\0';

printf("\n\n Destuffed msg is : %s", msg3);

printf("\n\n\n ");

return 0;

Output:

Enter data: abc#*pqr#@xyz

Original Data is : abc#*pqr#@xyz

Stuffed Data is : #abc##pqr##@xyz#@

Destuffed msg is : abc#*pqr#@xyz

6. CRC
#include<stdio.h>

int main()

char data[20] = {0};

char act[20] = {0};

char key[10] = {0};

int i;

printf("\nEnter the 7 data elements : ");

for(i=0;i<7;i++)

scanf("%d",&act[i]);

printf("\nEnter Key: ");

for(i=0;i<5;i++)

scanf("%d",&key[i]);

for(i=7;i<11;i++)

act[i]=0;

printf("\n\nStuffed data is : ");

for(i=0;i<11;i++)

printf("%d ",act[i]);

for(i=0;i<11;i++)

{
data[i]=act[i];

for(i=0;i<7;i++)

if(act[i]!=0)

act[i+0]=act[i+0]^key[0];

act[i+1]=act[i+1]^key[1];

act[i+2]=act[i+2]^key[2];

act[i+3]=act[i+3]^key[3];

act[i+4]=act[i+4]^key[4];

//printf("\n%d %d %d %d %d",act[i],act[i+1],act[i+2],act[i+3], act[i+4]);

data[7]=act[7];

data[8]=act[8];

data[9]=act[9];

data[10]=act[10];

printf("\n\nRemainder is : ");

for(i=7;i<11;i++)

printf(" %d ",act[i]);

printf("\n\nData sent is : ");

for(i=0; i<11; i++)

printf(" %d ",data[i]);

return 0;

Output:

Enter the 7 data elements : 1 0 1 0 1 0 1

Enter Key

Stuffed data is : 1 0 1 0 1 0 1 0 0 0 0

Remainder is : 0 1 0 0

Data sent is : 1 0 1 0 1 0 1 0 1 0 0

7. Go back N
#include<stdio.h>

void delay()

int c, d;

for (c = 1; c <= 20000; c++)

for (d = 1; d <= 20000; d++){}

}
}

int main()

int w,p,packets[50];

int i,cnt,flag=0;

char ch;

printf("\n Enter window size: ");

scanf("%d",&w);

printf("\n Enter number of packet to transmit: ");

scanf("%d",&p);

printf("\n Enter %d packets: ",p);

for(i=1;i<=p;i++)

scanf("%d",&packets[i]);

cnt=0;

printf("\n\n-------------------------------------------------------\n");

for(i=1;i<=p;i++)

delay();
fflush(stdin);

printf("\n\n Packet %d ( Data: %d ) Received?(y/n): ",i,packets[i]);

scanf("%c",&ch);

if(ch=='n')

printf("\n Not Received Acknowledgement of Packet %d ( Data: %d )",i,packets[i]);

printf("\n\n-------------------------------------------------------\n");

i=i-cnt-1;

else

if(i%w==0)

printf("\n Received Acknowledgement of Packet %d ( Data: %d )",i,packets[i]);

printf("\n\n-------------------------------------------------------\n");

cnt=0;

else

printf("\n Received Acknowledgement of Packet %d ( Data: %d )",i,packets[i]);

cnt++;

printf("\n\n-------------------------------------------------------");
printf("\n\n\n ");

return 0;

Output:

Enter window size: 4

Enter number of packet to transmit: 10

Enter 10 packets: 10 20 30 40 50 60 70 80 90 100

-------------------------------------------------------

Packet 1 ( Data: 10 ) Received?(y/n): y

Received Acknowledgement of Packet 1 ( Data: 10 )

Packet 2 ( Data: 20 ) Received?(y/n): y

Received Acknowledgement of Packet 2 ( Data: 20 )

Packet 3 ( Data: 30 ) Received?(y/n): y

Received Acknowledgement of Packet 3 ( Data: 30 )

Packet 4 ( Data: 40 ) Received?(y/n): y

Received Acknowledgement of Packet 4 ( Data: 40 )

-------------------------------------------------------
Packet 5 ( Data: 50 ) Received?(y/n): y

Received Acknowledgement of Packet 5 ( Data: 50 )

Packet 6 ( Data: 60 ) Received?(y/n): y

Received Acknowledgement of Packet 6 ( Data: 60 )

Packet 7 ( Data: 70 ) Received?(y/n): n

Not Received Acknowledgement of Packet 7 ( Data: 70 )

-------------------------------------------------------

Packet 5 ( Data: 50 ) Received?(y/n): y

Received Acknowledgement of Packet 5 ( Data: 50 )

Packet 6 ( Data: 60 ) Received?(y/n): y

Received Acknowledgement of Packet 6 ( Data: 60 )

Packet 7 ( Data: 70 ) Received?(y/n): y

Received Acknowledgement of Packet 7 ( Data: 70 )

Packet 8 ( Data: 80 ) Received?(y/n): y

Received Acknowledgement of Packet 8 ( Data: 80 )

-------------------------------------------------------

Packet 9 ( Data: 90 ) Received?(y/n): y

Received Acknowledgement of Packet 9 ( Data: 90 )

Packet 10 ( Data: 100 ) Received?(y/n): n

Not Received Acknowledgement of Packet 10 ( Data: 100 )

-------------------------------------------------------

Packet 9 ( Data: 90 ) Received?(y/n): y

Received Acknowledgement of Packet 9 ( Data: 90 )

Packet 10 ( Data: 100 ) Received?(y/n): y

Received Acknowledgement of Packet 10 ( Data: 100 )

-------------------------------------------------------
8. Hamming Code
#include<stdio.h>

#include<conio.h>

#include<math.h>

int main()

int ham[12],ham1[12],i;

int p1,p2,p3,p4;

printf("\n Enter 7 data bits: ");

for(i=1;i<=11;i++)

if(i==1 || i==2 || i==4 || i==8)

continue;

else

scanf("%d", &ham[i]);

p1=ham[3]^ham[5]^ham[7]^ham[9]^ham[11];
p2=ham[3]^ham[6]^ham[7]^ham[10]^ham[11];

p3=ham[5]^ham[6]^ham[7];

p4=ham[9]^ham[10]^ham[11];

ham[1]=p1;

ham[2]=p2;

ham[4]=p3;

ham[8]=p4;

printf("\n\n Parity bits are: ");

for(i=1;i<=11;i++)

if(i==1 || i==2 || i==4 || i==8)

printf("%d ", ham[i]);

printf("\n\n Hamming code is: ");

for(i=1;i<=11;i++)

printf("%d ", ham[i]);

printf("\n\n\n Hamming code is sent ..........");

printf("\n\n\n Received code is: ");

for(i=1;i<=11;i++)

printf("%d ", ham[i]);

printf("\n\n Enter recived data: ");

for(i=1;i<=11;i++)

scanf("%d",&ham1[i]);

p1=ham1[3]^ham1[5]^ham1[7]^ham1[9]^ham1[11];

p2=ham1[3]^ham1[6]^ham1[7]^ham1[10]^ham1[11];

p3=ham1[5]^ham1[6]^ham1[7];

p4=ham1[9]^ham1[10]^ham1[11];

if(p1==ham1[1] && p2==ham1[2] && p3==ham1[4] && p4==ham1[8])

printf("\n\n Data is Error Free.......");

else

printf("\n\n Data has Error.......");

}
printf("\n\n\n ");

return 0;

Output:

Enter 7 data bits: 1 0 0 1 0 0 0

Parity bits are: 0 0 1 0

Hamming code is: 0 0 1 1 0 0 1 0 0 0 0

Hamming code is sent ..........

Received code is: 0 0 1 1 0 0 1 0 0 0 0

Enter recived data: 0 0 1 1 0 0 1 0 0 0 0

Data is Error Free.......

10. Selective Repeat

#include<stdio.h>

void delay()

int c, d;

for (c = 1; c <= 20000; c++)

for (d = 1; d <= 20000; d++){}

}
int main()

int w,p,packets[50];

int i,flag=0;

char ch;

printf("\n Enter window size: ");

scanf("%d",&w);

printf("\n Enter number of packet to transmit: ");

scanf("%d",&p);

printf("\n Enter %d packets: ",p);

for(i=1;i<=p;i++)

scanf("%d",&packets[i]);

printf("\n\n------------------------------------------------------\n");

for(i=1;i<=p;i++)

delay();

fflush(stdin);
printf("\n\n Packet %d ( Data: %d ) Received?(y/n): ",i,packets[i]);

scanf("%c",&ch);

if(ch=='n')

flag=1;

printf("\n\n Not Received Acknowledgement of Packet %d ( Data: %d

)",i,packets[i]);

printf("\n\n Retrnsmitting Packet %d ( Data: %d ) ......\n",i,packets[i]);

i--;

else

if(i%w==0)

printf("\n Received Acknowledgement of Packet %d ( Data: %d )",i,packets[i]);

printf("\n\n------------------------------------------------------\n");

else

printf("\n Received Acknowledgement of Packet %d ( Data: %d )",i,packets[i]);

printf("\n\n------------------------------------------------------");

printf("\n\n\n ");
return 0;

Output:

Enter window size: 4

Enter number of packet to transmit: 10

Enter 10 packets: 10 20 30 40 50 60 70 80 90 100

------------------------------------------------------

Packet 1 ( Data: 10 ) Received?(y/n): y

Received Acknowledgement of Packet 1 ( Data: 10 )

Packet 2 ( Data: 20 ) Received?(y/n): y

Received Acknowledgement of Packet 2 ( Data: 20 )

Packet 3 ( Data: 30 ) Received?(y/n): y

Received Acknowledgement of Packet 3 ( Data: 30 )

Packet 4 ( Data: 40 ) Received?(y/n): y

Received Acknowledgement of Packet 4 ( Data: 40 )

------------------------------------------------------

Packet 5 ( Data: 50 ) Received?(y/n): y

Received Acknowledgement of Packet 5 ( Data: 50 )

Packet 6 ( Data: 60 ) Received?(y/n): n

Not Received Acknowledgement of Packet 6 ( Data: 60 )

Retrnsmitting Packet 6 ( Data: 60 ) ......

Packet 6 ( Data: 60 ) Received?(y/n): y

Received Acknowledgement of Packet 6 ( Data: 60 )

Packet 7 ( Data: 70 ) Received?(y/n): y

Received Acknowledgement of Packet 7 ( Data: 70 )

Packet 8 ( Data: 80 ) Received?(y/n): y

Received Acknowledgement of Packet 8 ( Data: 80 )

------------------------------------------------------

Packet 9 ( Data: 90 ) Received?(y/n): y

Received Acknowledgement of Packet 9 ( Data: 90 )

Packet 10 ( Data: 100 ) Received?(y/n): n

Not Received Acknowledgement of Packet 10 ( Data: 100 )

Retrnsmitting Packet 10 ( Data: 100 ) ......

Packet 10 ( Data: 100 ) Received?(y/n): y

Received Acknowledgement of Packet 10 ( Data: 100 )

------------------------------------------------------
11. Stop and Wait
#include<stdio.h>

void delay()

int c, d;

for (c = 1; c <= 20000; c++)

for (d = 1; d <= 20000; d++){}

int main()

char msg[2000];

int i=0;

char ch;

printf("\n Enter data: ");

scanf("%s",msg);

while(i<strlen(msg))

printf("\n Sending data %c",msg[i]);

delay();

fflush(stdin);
printf("\n Data Received (y/n)?: ");

scanf("%c",&ch);

if(ch=='y')

i++;

else

printf("\n\n ReSending......");

printf("\n\n\n ");

return 0;

Output:

Enter data: hi

Sending data h

Data Received (y/n)?: y

Sending data i

Data Received (y/n)?: n

ReSending......

Sending data i

Data Received (y/n)?: y

12. IP Address:
#include<stdio.h>

#include<stdlib.h>

void dtob(int a,int b,int c,int d);

void btod(int n1,int n2,int n3,int n4);

int main()

int ch;

int n1,n2,n3,n4;

while(1)

printf("\n\n IP ADDRESS....\n\n 1.DECIMAL TO BINARY\n 2.BINARY TO DECIMAL\n

3.EXIT");

printf("\n\n Enter Your Choice: ");

scanf("%d",&ch);

switch(ch)

case 1:

printf("\n Enter the IP address : ");

scanf("%d.%d.%d.%d",&n1,&n2,&n3,&n4);

dtob(n1,n2,n3,n4);

break;

case 2:

printf("\n Enter the IP address : ");

scanf("%d.%d.%d.%d",&n1,&n2,&n3,&n4);
btod(n1,n2,n3,n4);

break;

case 3:

printf("\n\n ");

exit(0);

default:

printf("\n INVALID CHOICE......");

break;

return 0;

void dtob(int n1,int n2,int n3,int n4)

int a1[10],a2[10],a3[10],a4[10];

int i,j,k,l;

printf("\n Decimal IP Address is : %d.%d.%d.%d\n",n1,n2,n3,n4);

printf("\n Binary IP Address is : ");

for(i=0;n1>0;i++)

a1[i]=n1%2;

n1=n1/2;
}

for(i=i-1;i>=0;i--)

printf("%d",a1[i]);

printf(".");

for(i=0;n2>0;i++)

a2[i]=n2%2;

n2=n2/2;

for(i=i-1;i>=0;i--)

printf("%d",a2[i]);

printf(".");

for(i=0;n3>0;i++)

a3[i]=n3%2;

n3=n3/2;

}
for(i=i-1;i>=0;i--)

printf("%d",a3[i]);

printf(".");

for(i=0;n4>0;i++)

a4[i]=n4%2;

n4=n4/2;

for(i=i-1;i>=0;i--)

printf("%d",a4[i]);

void btod(int n1,int n2,int n3,int n4)

int binary_val, decimal_val = 0, base = 1, rem;

printf("\n Binary IP Address is : %d.%d.%d.%d\n",n1,n2,n3,n4);

printf("\n Decimal IP Address is : ");

binary_val = n1;
while (n1 > 0)

rem = n1 % 10;

decimal_val = decimal_val + rem * base;

n1 = n1 / 10 ;

base = base * 2;

printf("%d.", decimal_val);

binary_val = n2;

decimal_val = 0;

base = 1;

while (n2 > 0)

rem = n2 % 10;

decimal_val = decimal_val + rem * base;

n2 = n2 / 10 ;

base = base * 2;

printf("%d.", decimal_val);

binary_val = n3;

decimal_val = 0;

base = 1;
while (n3 > 0)

rem = n3 % 10;

decimal_val = decimal_val + rem * base;

n3 = n3 / 10 ;

base = base * 2;

printf("%d.", decimal_val);

binary_val = n4;

decimal_val = 0;

base = 1;

while (n4 > 0)

rem = n4 % 10;

decimal_val = decimal_val + rem * base;

n4 = n4 / 10 ;

base = base * 2;

printf("%d", decimal_val);

OutPut:

IP ADDRESS....

1.DECIMAL TO BINARY

2.BINARY TO DECIMAL
3.EXIT

Enter Your Choice: 1

Enter the IP address : 210.172.12.13

Decimal IP Address is : 210.172.12.13

Binary IP Address is : 11010010.10101100.1100.1101

IP ADDRESS....

1.DECIMAL TO BINARY

2.BINARY TO DECIMAL

3.EXIT

Enter Your Choice: 2

Enter the IP address : 11010010.10101100.1100.1101

Binary IP Address is : 11010010.10101100.1100.1101

Decimal IP Address is : 210.172.12.13

Component Catalogue Formwork 2009 en
100% (2)
Component Catalogue Formwork 2009 en
652 pages
EC3401-NS Record
No ratings yet
EC3401-NS Record
51 pages
Network
No ratings yet
Network
67 pages
N&S Lab Manual
No ratings yet
N&S Lab Manual
27 pages
Ns Lab Manual Programs
No ratings yet
Ns Lab Manual Programs
33 pages
DCCN Lab Manual
No ratings yet
DCCN Lab Manual
28 pages
Ec3401-Networks and Security - 1932694304-Ec 3401 N&s Lab Manual - 2021 Reg
No ratings yet
Ec3401-Networks and Security - 1932694304-Ec 3401 N&s Lab Manual - 2021 Reg
30 pages
CN Lab Manual-Min
No ratings yet
CN Lab Manual-Min
37 pages
Ec3401-Networks and Security Lab Manual
No ratings yet
Ec3401-Networks and Security Lab Manual
33 pages
CN Lab
No ratings yet
CN Lab
14 pages
NETWORK
No ratings yet
NETWORK
47 pages
NP Lab MANUAL
No ratings yet
NP Lab MANUAL
40 pages
CN Lab Manual
No ratings yet
CN Lab Manual
52 pages
CN Lab Programs
No ratings yet
CN Lab Programs
66 pages
CN Program1-1
No ratings yet
CN Program1-1
11 pages
Cnprogm 1
No ratings yet
Cnprogm 1
13 pages
CN Lab
No ratings yet
CN Lab
88 pages
CN Lab Programs
No ratings yet
CN Lab Programs
30 pages
CN Lab Manual (1-9)
No ratings yet
CN Lab Manual (1-9)
31 pages
NS
No ratings yet
NS
8 pages
SE, CN, CD Files
No ratings yet
SE, CN, CD Files
75 pages
CN LAB Manual
No ratings yet
CN LAB Manual
38 pages
NS Lab Final
No ratings yet
NS Lab Final
369 pages
Manual 2 ND
No ratings yet
Manual 2 ND
9 pages
Networks and Security Lab Manual
No ratings yet
Networks and Security Lab Manual
29 pages
CN Lab Programs R20
No ratings yet
CN Lab Programs R20
38 pages
Ex No 3&4 - Bit and Byte Stuffing
No ratings yet
Ex No 3&4 - Bit and Byte Stuffing
6 pages
CN Lab
No ratings yet
CN Lab
12 pages
Aim: Program:: Implement The Data Link Layer Framing Methods Such As Character Count
100% (1)
Aim: Program:: Implement The Data Link Layer Framing Methods Such As Character Count
21 pages
Computer Network Lab File
No ratings yet
Computer Network Lab File
34 pages
Network & Security Manual
No ratings yet
Network & Security Manual
84 pages
CN Lab Manual
No ratings yet
CN Lab Manual
101 pages
CN
No ratings yet
CN
15 pages
Ns Manual Edited
No ratings yet
Ns Manual Edited
74 pages
I) Bit Stuffing: 1. Write A Program For A HLDC Frame To Perform The Following
No ratings yet
I) Bit Stuffing: 1. Write A Program For A HLDC Frame To Perform The Following
5 pages
Network and Communication Lab: 1. Two Dimensional Parity Check
No ratings yet
Network and Communication Lab: 1. Two Dimensional Parity Check
24 pages
Computer Network Practical Programme 1
No ratings yet
Computer Network Practical Programme 1
4 pages
Computer Networks Lab
No ratings yet
Computer Networks Lab
70 pages
Network Security Record
No ratings yet
Network Security Record
72 pages
Bit Stuffing
No ratings yet
Bit Stuffing
9 pages
Networks and Security Lab Manual
No ratings yet
Networks and Security Lab Manual
91 pages
CN Experiment - 3
No ratings yet
CN Experiment - 3
4 pages
Ns Codes
No ratings yet
Ns Codes
19 pages
CN Lab Manual SCCE
No ratings yet
CN Lab Manual SCCE
72 pages
CN&WP Lab Manual
No ratings yet
CN&WP Lab Manual
80 pages
Sliding Window
No ratings yet
Sliding Window
4 pages
III-I CN Lab Manual
No ratings yet
III-I CN Lab Manual
52 pages
VCNLB 2023
No ratings yet
VCNLB 2023
14 pages
Cn-Lab - Task-1 A&b
No ratings yet
Cn-Lab - Task-1 A&b
4 pages
Communication Network Observation - Prethika A S - 910618106036
No ratings yet
Communication Network Observation - Prethika A S - 910618106036
55 pages
Ns Lab Manual
No ratings yet
Ns Lab Manual
68 pages
CNP LAB Programs
No ratings yet
CNP LAB Programs
36 pages
Practical File of Computer Network
No ratings yet
Practical File of Computer Network
16 pages
CN - PART B
No ratings yet
CN - PART B
17 pages
CN Lab Manual
No ratings yet
CN Lab Manual
41 pages
Computer Networks Record: Pojit
No ratings yet
Computer Networks Record: Pojit
10 pages
2023 Regulation Lab Manual Ns
No ratings yet
2023 Regulation Lab Manual Ns
69 pages
III CSE - 1 - Computer Network Lab Manual R18
No ratings yet
III CSE - 1 - Computer Network Lab Manual R18
83 pages
150+ JavaScript Pattern Programs
From Everand
150+ JavaScript Pattern Programs
Hernando Abella
No ratings yet
150+ C Pattern Programs
From Everand
150+ C Pattern Programs
Hernando Abella
No ratings yet
Comptia Pentest pt0 003 Exam Objectives (2 0)
No ratings yet
Comptia Pentest pt0 003 Exam Objectives (2 0)
16 pages
Interview Questions To Ask A Cyber Security Analyst Xobin Downloaded
No ratings yet
Interview Questions To Ask A Cyber Security Analyst Xobin Downloaded
8 pages
Comptia Securityx Cas 005 Exam Objectives (2 0)
No ratings yet
Comptia Securityx Cas 005 Exam Objectives (2 0)
16 pages
Student Manual - Speaking
No ratings yet
Student Manual - Speaking
43 pages
Dec 2013
No ratings yet
Dec 2013
10 pages
MSE UCSE0602 - T.Y.B.Tech-A
No ratings yet
MSE UCSE0602 - T.Y.B.Tech-A
1 page
MSE-MAR 2021 Students Instructions-4.3.21
No ratings yet
MSE-MAR 2021 Students Instructions-4.3.21
51 pages
Fuzzy Arithmetic
No ratings yet
Fuzzy Arithmetic
17 pages
Hello Kit
No ratings yet
Hello Kit
9 pages
UCSE0601 - B.Tech M.Tech - MSE - Set - A - Ok
No ratings yet
UCSE0601 - B.Tech M.Tech - MSE - Set - A - Ok
1 page
College of Engineering (Autonomous), Kolhapur
No ratings yet
College of Engineering (Autonomous), Kolhapur
4 pages
Cheatsheet For Nano
No ratings yet
Cheatsheet For Nano
2 pages
Gurung Lal
No ratings yet
Gurung Lal
43 pages
Chapter-1: Fundamental Concepts Set-B: Page 1 of 2
No ratings yet
Chapter-1: Fundamental Concepts Set-B: Page 1 of 2
2 pages
Enterprise Datacenter Solution
No ratings yet
Enterprise Datacenter Solution
2 pages
GC or PSX Stick in N64 Controller v1.2
No ratings yet
GC or PSX Stick in N64 Controller v1.2
10 pages
AIRE-FLO-HEAT-PUMP-SEER12 (We Have 12B36)
No ratings yet
AIRE-FLO-HEAT-PUMP-SEER12 (We Have 12B36)
3 pages
Product Line Up TSP Business: Emergency Genset Oil & Gas Industrial Equipment
No ratings yet
Product Line Up TSP Business: Emergency Genset Oil & Gas Industrial Equipment
2 pages
ADS Single Stub Tutorial
No ratings yet
ADS Single Stub Tutorial
24 pages
Catalogo Generale
No ratings yet
Catalogo Generale
67 pages
Project Management Course 2024 (Manual 1)
No ratings yet
Project Management Course 2024 (Manual 1)
68 pages
Sperry Sun Manchester Decoding
No ratings yet
Sperry Sun Manchester Decoding
8 pages
BTS Power Consumption
50% (2)
BTS Power Consumption
3 pages
Branch Visit Guideline
No ratings yet
Branch Visit Guideline
3 pages
Case Study Aplikasi E-Commerce
No ratings yet
Case Study Aplikasi E-Commerce
9 pages
Per Unit System - Example
100% (1)
Per Unit System - Example
9 pages
Upsc Mathematics Optional Solution 1 2018
No ratings yet
Upsc Mathematics Optional Solution 1 2018
50 pages
UlkuOktem UsingBigDataToPredictProcessRisks
No ratings yet
UlkuOktem UsingBigDataToPredictProcessRisks
8 pages
MAS345
No ratings yet
MAS345
31 pages
DL-T 5358-2006 Technical Code For Anticorrosion of Metal Structures in Hydroelectric and Hydraulic Engineering
No ratings yet
DL-T 5358-2006 Technical Code For Anticorrosion of Metal Structures in Hydroelectric and Hydraulic Engineering
43 pages
Media Planning and Buying
No ratings yet
Media Planning and Buying
113 pages
Observership Application Process
No ratings yet
Observership Application Process
2 pages
Plutonium Report
No ratings yet
Plutonium Report
359 pages
Cryptocurrency
100% (1)
Cryptocurrency
19 pages
Hotpoint Bhwm129uk-1
No ratings yet
Hotpoint Bhwm129uk-1
13 pages
Chapter 1. How The Internet Works
No ratings yet
Chapter 1. How The Internet Works
3 pages
2013 Brochure Modernizations Upgrades Steam Turbines en
No ratings yet
2013 Brochure Modernizations Upgrades Steam Turbines en
16 pages
Shanuresumeupdated 1
No ratings yet
Shanuresumeupdated 1
2 pages
Problem - Impact of Jet
No ratings yet
Problem - Impact of Jet
14 pages
Bend Test
No ratings yet
Bend Test
14 pages
Tds (FR En) Arthane 101 - Appendice A 2018.12.20
No ratings yet
Tds (FR En) Arthane 101 - Appendice A 2018.12.20
3 pages
00 Datasheet of STS For 200 - 215KTL - Others - 20210928
No ratings yet
00 Datasheet of STS For 200 - 215KTL - Others - 20210928
4 pages

Kit DCN Program

Uploaded by

Kit DCN Program

Uploaded by

DCN Programs

char msg1[2000], msg2[2000], msg3[2000];

int i=0, j=0;

printf("\n Enter frame(0's and 1's): ");

if(msg1[i]=='1' && msg1[i+1]=='1' && msg1[i+2]=='1' && msg1[i+3]=='1' && msg1[i+4]=='1')

printf("\n\n Original Data is : %s", msg1);

printf("\n\n Stuffed Data is : %s", msg2);

if(msg2[i]=='1' && msg2[i+1]=='1' && msg2[i+2]=='1' && msg2[i+3]=='1' && msg2[i+4]=='1'

printf("\n\n Destuffed msg is : %s", msg3);

Enter frame(0's and 1's): 011110111101111110110

Original Data is : 011110111101111110110

Stuffed Data is : 0111101111011111010110

Destuffed msg is : 011110111101111110110

char msg1[2000], msg2[2000], msg3[2000],temp[2000];

int i=0, j=0;

printf("\n Enter frame(0's and 1's): ");

if(msg1[i]=='0' && msg1[i+1]=='1' && msg1[i+2]=='1' && msg1[i+3]=='1' && msg1[i+4]=='1'

printf("\n\n Original Data is : %s", msg1);

printf("\n\n Stuffed Data is : %s", msg2);

if(msg2[i]=='0' && msg2[i+1]=='1' && msg2[i+2]=='1' && msg2[i+3]=='1' && msg2[i+4]=='1'

printf("\n\n Destuffed msg is : %s", msg3);

Enter frame(0's and 1's): 0111101111101111110

Original Data is : 0111101111101111110

Stuffed Data is : 011111100111101111101111101001111110

Destuffed msg is : 0111101111101111110

char msg1[50], msg2[50];

printf("\n Enter Message: ");

if(msg1[i] == ' ')

else if(msg1[i] == '\0')

printf("\n\n Original Data is : %s", msg1);

printf("\n\n Stuffed Data is : %s", msg2);

Enter Message: Shailesh Mohite

Original Data is : Shailesh Mohite

Stuffed Data is : 9Shailesh7Mohite

char msg1[2000], msg2[2000], msg3[2000];

int i=0, j=0;

printf("\n Enter data: ");

if(msg1[i]=='d' && msg1[i+1]=='l' && msg1[i+2]=='e')

printf("\n\n Original Data is : %s", msg1);

printf("\n\n Stuffed Data is : %s", msg2);

if(msg2[i]=='d' && msg2[i+1]=='l' && msg2[i+2]=='e' && msg2[i+3]=='d' &&

printf("\n\n Destuffed msg is : %s", msg3);

Enter data: kitcoek

Original Data is : kitcoek

Stuffed Data is : dlestxkitcoekdleetx

Destuffed msg is : kitcoek

char msg1[2000], msg2[2000], msg3[2000];

int i=0, j=0;

printf("\n Enter data: ");

if(msg1[i]=='#' && msg1[i+1]=='*')

else if(msg1[i]=='#' && msg1[i+1]=='@')

printf("\n\n Original Data is : %s", msg1);

printf("\n\n Stuffed Data is : %s", msg2);

if(msg2[i]=='#' && msg2[i+1]=='#' && msg2[i+2]=='*')

else if(msg2[i]=='#' && msg2[i+1]=='#' && msg2[i+2]=='@')

printf("\n\n Destuffed msg is : %s", msg3);

Enter data: abc#*pqr#@xyz

Original Data is : abc#*pqr#@xyz

Stuffed Data is : #*abc##*pqr##@xyz#@

Destuffed msg is : abc#*pqr#@xyz

char data[20] = {0};

char key[10] = {0};

printf("\nEnter the 7 data elements : ");

printf("\nEnter Key: ");

printf("\n\nStuffed data is : ");

//printf("\n%d %d %d %d %d",act[i],act[i+1],act[i+2],act[i+3], act[i+4]);

printf("\n\nData sent is : ");

Enter the 7 data elements : 1 0 1 0 1 0 1

for (c = 1; c <= 20000; c++)

for (d = 1; d <= 20000; d++){}

printf("\n Enter window size: ");

printf("\n Enter number of packet to transmit: ");

printf("\n Enter %d packets: ",p);

printf("\n\n Packet %d ( Data: %d ) Received?(y/n): ",i,packets[i]);

printf("\n Not Received Acknowledgement of Packet %d ( Data: %d )",i,packets[i]);

printf("\n Received Acknowledgement of Packet %d ( Data: %d )",i,packets[i]);

Stuffed Data is : #abc##pqr##@xyz#@