CN lab internal

 👇👇 To paste in putty just right click on terminal👇👇

1. Bitstuffing

//Program:(bit-stuffing) #include<stdio.h> main() { int i,k,a,count=0; char c[50]; printf("\nEnter the data to be send:"); fflush(stdin); gets(c); a=strlen(c); for(i=0;i<a;i++) { if(c[i]=='1') { count++; if(count==6) { for(k=a;k>i+1;k--) c[k]=c[k-1]; a=a+1; count=0; c[i+1]='0'; } } else count = 0; } printf("\nData after stuffing:"); puts(c); count=0; for(i=0;i<a;i++) { if(c[i]=='1') { count++; if(count==5) { for(k=i+1;k<a;k++) c[k]=c[k+1]; count=0; } } } } /*Output: Enter the data to be send:11111111 Data after stuffing:111110111 */

1.i character stuffing

//Program:(character-stuffing) #include<stdio.h> main() { char a[50],b[50],c[50]; int i,j,k,m=0,count,l1,l2; printf("\nEnter the data to send:"); fflush(stdin); gets(a); printf("\nEnter the delimeter:"); fflush(stdin); gets(b); l1=strlen(a); l2=strlen(b); c[0]='S'; for(i=0;i<l2;i++) c[i+1]=b[i]; for(j=0;j<l1;j++) { count=0; for(k=0,m=j;k<l2;k++,m++) { if(a[m]!=b[k]) count=1; } if(count==0) { for(k=l1+l2-1;k>m;k--) a[k]=a[k-l2]; for(k=0;k<l2;k++) a[m++]=b[k]; j=j+l2; l1=l1+l2; } } for(k=0;k<l1;k++) c[++i]=a[k]; for(k=0;k<l2;k++) c[++i]=b[k]; c[++i]='E'; printf("\nData after stuffing:"); for(k=0;k<=i;k++) printf("%c",c[k]); for(j=0;j<l1-l2;j++) { count=0; m=j; for(k=0;k<l2;k++) { if(a[m++]!=b[k]) count=1; } if(count==0) { for(k=m;k<l1-l2;k++) a[k]=a[k+l2]; l1=l1-l2; } } printf("\nData after destuffing:"); for(i=0;i<l1;i++) printf("%c",a[i]); }/* Output: Enter the data to send : hi hello hai Enter the delimeter: l Data after stuffing: slhi hellllo hai le Data after destuffing: hi hello hai*/

2. CRC

//Program: crc #include<stdio.h> #include<stdlib.h> int main() { int i,j,k=0; int flag=1,a[16],g[16],r[20],div[16],n,m; system("clear"); printf("Enter degree of generator:"); scanf("%d",&n); printf("\n Enter the generator:\n"); for(i=0;i<=n;i++) scanf("%d",&g[i]); printf("\nEnter the degree of the frame:"); scanf("%d",&m); printf("Enter the frame:\n"); for(i=0;i<=m;i++) scanf("%d",&a[i]); if(m<n || g[0]==0) { printf("Not a proper generator:\n"); exit(0); } for(i=m+1;i<=m+n;i++) a[i]=0; for(j=0;j<=n;j++) r[j]=a[j]; for(i=n;i<=m+n;i++) { if(i>n) { for(j=0;j<n;j++) r[j]=r[j+1]; r[j]=a[i]; } if(r[0]) div[k++]=1; else { div[k++]=0; continue; } for(j=0;j<=n;j++) r[j]=r[j]^g[j]; } printf("\n Quotient is:"); for(j=0;j<k;j++) printf("%d",div[j]); printf("\n Remainder is:"); for(i=1;i<=n;i++) printf("%d",r[i]); printf("\n Transmitted frame is:"); for(i=m+1,j=1;i<=m+n;i++) printf("%d",a[i]); printf("\n"); printf("\n Enter the degree of frame:"); scanf("%d",&m); printf("Enter the frame:\n"); for(i=0;i<=m;i++) scanf("%d",&a[i]); for(j=0;j<=n;j++) r[j]=a[j]; k=0; for(i=n;i<=m;i++) { if(i>n) { for(j=0;j<n;j++) r[j]=r[j+1]; r[j]=a[i]; } if(r[0]) div[k++]=1; else { div[k++]=0; continue; } for(j=0;j<=n;j++) r[j]=r[j]^g[j]; } printf("\n Quotient is:"); for(j=0;j<k;j++) printf("%d",div[j]); printf("\n Remainder is:"); for(i=1;i<=n;i++) printf("%d",r[i]); for(i=1;i<=n;i++) { if(r[i]) flag=0; } if(flag) printf("\n No Error \n"); else printf("\n Error"); return 0; }/* OUTPUT: Enter the degree of the generator:3 Enter the generator: 1 0 0 1 Enter the degree of the frame:7 Enter the frame :*/

3. Sliding window protocol

//program sliding window protocol #include<stdio.h> int main() { int w,i,f,frames[50]; printf("Enter window size: "); scanf("%d",&w); printf("\nEnter number of frames to transmit: "); scanf("%d",&f); printf("\nEnter %d frames: ",f); for(i=1;i<=f;i++) scanf("%d",&frames[i]); printf("\nWith sliding window protocol the frames will be sent in the following manner assuming:\n"); printf("After sending %d frames at each stage sender waits for acknowledgement sent by ther\n",w); for(i=1;i<=f;i++) { if(i%w==0) { printf("%d\n",frames[i]); printf("Acknowledgement of above frames sent is received by sender\n\n"); } else printf("%d ",frames[i]); } if(f%w!=0) printf("\nAcknowledgement of above frames sent is received by sender\n"); return 0; } /* Output Enter window size: 3 Enter number of frames to transmit: 5 Enter 5 frames: 12 5 89 4 6 With sliding window protocol the frames will be sent in the following manner (assuming no corruption of frames) After sending 3 frames at each stage sender waits for acknowledgement sent by the receiver 12 5 89 Acknowledgement of above frames sent is received by sender 4 6 Acknowledgement of above frames sent is received by sender */

4. Dijkastras

//program Dijkastras #include<stdio.h> #include<stdlib.h> //#include<string.h> #define M_NODES 10 #define INFINITY 1000 int n,dis[M_NODES][M_NODES]; void main() { void spath(int,int); int i,j,g[100][100],s,t,c; printf("\nEnter number of nodes:"); scanf("%d",&n); for(i=0;i<n;i++) { for(j=i;j<n;j++) { printf("\nEnter weight between %d-->%d\t",i,j); scanf("%d",&c); if(c>=0) dis[i][j]=c; else exit(0); } } printf("\nEnter source and destination nodes:"); scanf("%d%d",&t,&s); spath(s,t); //getch(); } void spath(int s,int t) { struct state { int pre,len; enum{permanet,tentative} label; }state[M_NODES]; int i,k,min,path[20],c=0; struct state *p; for(p=&state[0];p<&state[n];p++) { p->pre=-1; p->len=INFINITY; p->label=tentative; } state[t].len=0; state[t].label=permanet; k=t; do { for(i=0;i<n;i++) if(dis[k][i]!=0&&state[i].label==tentative) { if(state[k].len+dis[k][i]<state[i].len) { state[i].pre=k; state[i].len=state[k].len+dis[k][i]; } } k=0; min=INFINITY; for(i=0;i<n;i++) { if(state[i].label==tentative&&state[i].len<min ) { min=state[i].len; k=i; } } state[k].label=permanet; }while(k!=s); i=0; k=s; do { path[i++]=k; k=state[k].pre; c++; }while(k>=0); printf("\nMinimum Cost is=%d",min); printf("\nShortest path is="); for(k=c-1;k>=0;k--) printf("%d-->",path[k]); } /*Output: Enter number of nodes:5 Enter weight between 0-->0 0 Enter weight between 0-->1 1 Enter weight between 0-->2 7 Enter weight between 0-->3 2 Enter weight between 0-->4 0 Enter weight between 1-->1 0 Enter weight between 1-->2 3 Enter weight between 1-->3 4 enter source and destination node 0 3 minimum cost is 2 */