CN lab programs

Cn manual 👇👇

All programs are well executed if any error comes comment below..

PROGRAMS:

1. bit-stuffing

2. (character-stuffing)

//(character-stuffing)
#include<stdio.h> 
#include<string.h>
int main()
{
char a[50],b[50],c[50]; 
int i,j,k,m=0,count,l1,l2;
printf("Enter the data to send:"); 
fflush(stdin);
gets(a);
printf("Enter 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("Data 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]);
return 0;
}
/*output
Enter the data to send:hi hello hai
Enter the delimeter:1
Data after stuffing:S1hi hello hai1E
Data after destuffing:hi hello hai
*/

3. Cyclic Redundancy Check(CRC)

//Cyclic Redundancy Check(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 degree of generator:3

Enter the generator:
1 0 0 1

Enter the degree of the frame:7
Enter the frame:
1 1 1 1 1 1 1 1

Quotient is:11100011
 Remainder is:011
 Transmitted frame is:000

Enter the degree of frame:10
Enter the frame:
1 1 1 1 1 1 1 1 0 1 1

Quotient is:11100011
 Remainder is:000
 No Error 
*/

4. sliding window protocol, and loss recovery using the Go-Back-N mechanism.

#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 no corruption of frames)\n\n");
    printf("After sending %d frames at each stage sender waits for acknowledgement sent by the receiver\n\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
*/

5. Dijikstra’s Algorithm

//dijikstra’s Algorithm
#include<stdio.h>
#include<stdlib.h>
#define M_NODES 10
#define INFINITY 1000
int n,dis[M_NODES][M_NODES]; 
int 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();
return 0;
}
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
r weight between 0-->3      2

Enter weight between 1-->1      0

Enter weight between 1-->2      3

Enter weight between 1-->3      4

Enter weight between 2-->2      0

Enter weight between 2-->3      4

Enter weight between 3-->3      0

Enter source and destination nodes:0 3

Minimum Cost is=2
Shortest path is=0-->3-->
*/

6. Implement broadcast tree for a given subnet of hosts

//Implement broadcast tree for a given subnet of hosts
#include<stdio.h>
int p,q,u,v,n;
int min=99,mincost=0; int t[50][2],i,j;
int parent[50],edge[50][50]; 
int main()
{
printf("Enter the number of nodes: "); 
scanf("%d",&n);
printf("  ");
for(i=0;i<n;i++)
{
printf("%c ",65+i);
parent[i]=-1;
}
printf("\n"); 
for(i=0;i<n;i++)
{
printf("%c ",65+i);
 
for(j=0;j<n;j++) 
scanf("%d",&edge[i][j]);
}
for(i=0;i<n;i++)
{
for(j=0;j<n;j++) if(edge[i][j]!=99)
if(min>edge[i][j])
{
min=edge[i][j]; u=i;
v=j;
}
p=find(u); q=find(v); if(p!=q)
{ t[i][0]=u;
t[i][1]=v; 
mincost=mincost+edge[u][v];
sunion(p,q);
}
else
{
t[i][0]=-1;
t[i][1]=-1;
}
min=99;
}
 
printf("Minimum cost is %d\nMinimum spanning tree is\n" ,mincost); for(i=0;i<n;i++)
if(t[i][0]!=-1 && t[i][1]!=-1)
{
printf("%c %c %d", 65+t[i][0], 65+t[i][1],
edge[t[i][0]][t[i][1]]); printf("\n");
}
}
int sunion(int l,int m)
{
parent[l]=m;
}
int find(int l)
{
if(parent[l]>0) 
l=parent[l];
return l;
}
/*output
Enter the number of nodes: 4
  A B C D 
A 1 3 5 6 
B 6 7 8 9
C 2 3 5 6
D 1 2 3 7
Minimum cost is 9
Minimum spanning tree is
B A 6
C A 2
D A 1
*/

7. Take an example subnet graph with weights indicating delay between nodes. Now obtain routing table at each node using vector routing algorithm.

/*Take an example subnet graph with weights indicating delay between nodes. Now obtain routing table at each node using vector routing algorithm.*/
#include<stdio.h> 
#include<conio.h>
#define MN 100
#define INFINITY 500 
char graph[30][30];
struct st
{
int a[20][20];
}st[20];
int n;
int main()
{
int i,j;
void disk(int,int);
//clrscr();
printf("Enter the number of nodes:"); 
scanf("%d",&n);
for(i=0;i<n;i++)
{
for(j=i;j<n;j++)
{
printf("Enter distance between %d -->%d: ",i,j);
scanf("%d",&graph[i][j]);
graph[j][i]=graph[i][j];
}
}
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
if(i!=j)
disk(i,j);
}
}
for(i=0;i<n;i++)
{	
printf("Routing table for node %d: ",i);
for(j=0;j<n;j++)
{
if(i!=j)
{
printf("%d | %d | %d",j,st[i].a[j][i],st[i].a[j][i+1]);
printf("\n 	\n");
}
}
}
}
void disk(int t,int s)
{
struct state
{
int predecessor; int length;
enum{permanent,tentative} label;
}
state[MN];

struct state *p; int path[MN]; int i,j,k,min;
for(p=&state[0];p<&state[n];p++)
{
p->predecessor=-1;
p->length=INFINITY; p->label=tentative;
}
state[t].length=0; state[t].label=permanent; k=t;
do
{
for(i=0;i<n;i++)
{
if((graph[k][i]!=0)&&(state[i].label==tentative))
{
if(state[k].length+graph[k][i]<state[i].length)
{
state[i].predecessor=k; state[i].length=state[k].length+graph[k][i];
}
}
}
k=0;
min=INFINITY;
for(i=0;i<n;i++)
{
if((state[i].label==tentative)&&(state[i].length<min))
{
min=state[i].length; k=i;
}
}
state[k].label=permanent;
}while(k!=s); i=0;
k=s;
do
{
    path[i++]=k; k=state[k].predecessor;
}while(k>=0); st[t].a[s][t]=path[i-2];
st[t].a[s][t+1]=state[s].length;
}

/*output
Enter the number of nodes:2
Enter distance between 0 -->0: 3 
Enter distance between 0 -->1: 3
Enter distance between 1 -->1: 5
Routing table for node 0: 1 | 1 | 3
Routing table for node 1: 0 | 0 | 3
*/

8. Take a 64 bit plain text and encrypt the same using DES algorithm. OR Decrypting DES.

/*
Take a 64 bit plain text and encrypt the same using DES algorithm.
*/
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
int main()
{
int i, ch, lp;
char cipher[50],plain[50]; 
char key[50];
while(1)
{
printf("\n-----MENU------\n");
printf("\n1:Data Encryption\t\n\n2:Data Decryption\t\n\n3:Exit"); printf("\n\nEnter your choice:");
scanf("%d",&ch); 
switch(ch)
{
case 1: printf("\nData Encryption");
printf("\nEnter the plain text:"); 
fflush(stdin); 
scanf("%s",&plain);
printf("\nEnter the encryption key:");
scanf("%s",&key);
lp=strlen(key); 
for(i=0;plain[i]!='\0';i++)
cipher[i]=plain[i]^lp;
cipher[i]='\0';
 printf("\nThe encrypted text is:");
 puts(cipher);
 break;
case 2: printf("\nData decryption"); 
for(i=0;cipher[i]!='\0';i++) 
plain[i]=cipher[i]^lp;
printf("\nDecrypted text is:");
puts(plain);
break;
case 3: exit(0);
}
}
return 0;
}
/*output
-----MENU------

1:Data Encryption

2:Data Decryption

3:Exit

Enter your choice:1

Data Encryption
Enter the plain text:cmrec

Enter the encryption key:21345

The encrypted text is:fhw`f

-----MENU------

1:Data Encryption

2:Data Decryption

3:Exit

Enter your choice:2

Data decryption
Decrypted text is:cmrec

-----MENU------

1:Data Encryption

2:Data Decryption

3:Exit

Enter your choice:3
*/

9. Leaky bucket algorithm

//Leaky bucket algorithm
#include<stdio.h>
#include<stdlib.h>
#include<unistd.h>
#define NOF_PACKETS 10
int rrand(int a)
{
int rn = (random() % 10) % a;
return rn == 0 ? 1 :rn;
}

int main()
{
int packet_sz[NOF_PACKETS], i, clk, b_size, o_rate, p_sz_rm=0, p_sz, p_time, op;
for(i = 0; i<NOF_PACKETS; ++i)
packet_sz[i] = rrand(6) * 10;
for(i = 0; i<NOF_PACKETS; ++i)
printf("\npacket[%d]:%d bytes\t", i, packet_sz[i]);
printf("\nEnter the Output rate:");
scanf("%d", &o_rate);
printf("Enter the Bucket Size:");
scanf("%d", &b_size);
for(i = 0; i<NOF_PACKETS; ++i)
    {
if( (packet_sz[i] + p_sz_rm) >b_size)
if(packet_sz[i] >b_size)/*compare the packet siz with bucket size*/
printf("\n\nIncoming packet size (%dbytes) is Greater than bucket capacity (%dbytes)-PACKET REJECTED", packet_sz[i], b_size);
else
printf("\n\nBucket capacity exceeded-PACKETS REJECTED!!");
else
        {
p_sz_rm += packet_sz[i];
printf("\n\nIncoming Packet size: %d", packet_sz[i]);
printf("\nBytes remaining to Transmit: %d", p_sz_rm);
p_time = rrand(4) * 10;
printf("\nTime left for transmission: %d units", p_time);
for(clk = 10; clk<= p_time; clk += 10)
            {
sleep(1);
if(p_sz_rm)
                {
if(p_sz_rm<= o_rate)/*packet size remaining comparing with output rate*/
op = p_sz_rm, p_sz_rm = 0;
else
op = o_rate, p_sz_rm -= o_rate;
printf("\nPacket of size %d Transmitted", op);
printf("----Bytes Remaining to Transmit: %d", p_sz_rm);
                }
else
                {
printf("\nTime left for transmission: %d units", p_time-clk);
printf("\nNo packets to transmit!!");
                }
            }
        }
    }
}
/*output
packet[0]:30 bytes
packet[1]:10 bytes
packet[2]:10 bytes
packet[3]:50 bytes
packet[4]:30 bytes
packet[5]:50 bytes
packet[6]:10 bytes
packet[7]:20 bytes
packet[8]:30 bytes
packet[9]:10 bytes
Enter the Output rate:10
Enter the Bucket Size:15

Incoming packet size (30bytes) is Greater than bucket capacity (15bytes)-PACKET REJECTED

Incoming Packet size: 10
Bytes remaining to Transmit: 10
Time left for transmission: 20 units
Packet of size 10 Transmitted----Bytes Remaining to Transmit: 0
Time left for transmission: 0 units
No packets to transmit!!

Incoming Packet size: 10
Bytes remaining to Transmit: 10
Time left for transmission: 30 units
Packet of size 10 Transmitted----Bytes Remaining to Transmit: 0
Time left for transmission: 10 units
No packets to transmit!!
Time left for transmission: 0 units
No packets to transmit!!

Incoming packet size (50bytes) is Greater than bucket capacity (15bytes)-PACKET REJECTED

Incoming packet size (30bytes) is Greater than bucket capacity (15bytes)-PACKET REJECTED

Incoming packet size (50bytes) is Greater than bucket capacity (15bytes)-PACKET REJECTED

Incoming Packet size: 10
Bytes remaining to Transmit: 10
Time left for transmission: 10 units
Packet of size 10 Transmitted----Bytes Remaining to Transmit: 0

Incoming packet size (20bytes) is Greater than bucket capacity (15bytes)-PACKET REJECTED

Incoming packet size (30bytes) is Greater than bucket capacity (15bytes)-PACKET REJECTED

Incoming Packet size: 10
Bytes remaining to Transmit: 10
Time left for transmission: 10 units
Packet of size 10 Transmitted----Bytes Remaining to Transmit: 0

10. Write a program for frame sorting technique used in buffers.

#include <stdlib.h>
#include <time.h>
#include <stdio.h>
#include <conio.h>
#include <string.h>
#define FSize 3
typedef struct packet
{
	int SeqNum; 
	char Data[FSize+1];
}packet;

struct packet *readdata, *transdata;
int divide(char *msg)
 {
	int msglen, NoOfPacket, i, j;
	msglen = strlen(msg);
	NoOfPacket = msglen/FSize;
	if ((msglen%FSize)!=0) NoOfPacket++;
	readdata = (struct packet *)malloc(sizeof(packet) * NoOfPacket);
	for(i = 0; i <NoOfPacket; i++)
	 {
		readdata[i].SeqNum = i + 1;
		for (j = 0; (j <FSize) && (*msg != '\0'); j++, msg++)
		readdata[i].Data[j] = *msg;
		readdata[i].Data[j] = '\0';
	}
	printf("\nThe Message has been divided as follows\n");
	printf("\nPacket No. Data\n\n");
	for (i = 0; i <NoOfPacket; i++)
	printf(" %2d %s\n", readdata[i].SeqNum,
	readdata[i].Data);
	return NoOfPacket;
}

void shuffle(int NoOfPacket) 
{
	int *Status;
	int i, j, trans;
	rand();
	Status=(int * )calloc(NoOfPacket, sizeof(int));
	transdata = (struct packet *)malloc(sizeof(packet) * NoOfPacket);
	for (i = 0; i <NoOfPacket;) 
	{
		trans = rand()%NoOfPacket;
		if (Status[trans]!=1) 
		{
			transdata[i].SeqNum = readdata[trans].SeqNum;
			strcpy(transdata[i].Data, readdata[trans].Data);
			i++; Status[trans] = 1;
		}
	}
	free(Status);
}
void sortframes(int NoOfPacket) 
{
	packet temp;
	int i, j;
	for (i = 0; i <NoOfPacket; i++)
	for (j = 0; j <NoOfPacket-i-1; j++)
	if (transdata[j].SeqNum>transdata[j + 1].SeqNum) 
	{
		temp.SeqNum = transdata[j].SeqNum;
		strcpy(temp.Data, transdata[j].Data);
		transdata[j].SeqNum = transdata[j + 1].SeqNum;
		strcpy(transdata[j].Data, transdata[j + 1].Data);
		transdata[j + 1].SeqNum = temp.SeqNum;
		strcpy(transdata[j + 1].Data, temp.Data);
	}
}

void receive(int NoOfPacket)
{
	int i;
	printf("\nPackets received in the following order\n");
	for (i = 0; i <NoOfPacket; i++)
printf("%4d", transdata[i].SeqNum);
	sortframes(NoOfPacket);
	printf("\n\nPackets in order after sorting..\n");
	for (i = 0; i <NoOfPacket; i++) 
	printf("%4d", transdata[i].SeqNum);
	printf("\n\nMessage received is :\n");
	for (i = 0; i <NoOfPacket; i++)
printf("%s", transdata[i].Data);
}

void main() 
{
	char *msg;
	int NoOfPacket;
// 	clrscr();
	printf("\nEnter The message to be Transmitted :\n");
	scanf("%[^\n]", msg);
	NoOfPacket = divide(msg);
	shuffle(NoOfPacket);
	receive(NoOfPacket);
	free(readdata);
	free(transdata);
// 	getch();
}
/*output
Enter The messgae to be Transmitted :
hi, it was nice meeting u on sunday
The Message has been divided as follows
Packet No.	 Data
1 		hi,
2 		it
3 		wa
4		 s n
5 		ice
6 		me
7 		eti
8 		ng
9 		u o
10		 n s
11 		und
12		 ay
Packets received in the following order
4 2 6 3 5 1 8 9 11 7 12 10
Packets in order after sorting..
1 2 3 4 5 6 7 8 9 10 11 12

Message received is :
hi, it was nice meeting u on sunday

CN lab programs

1. bit-stuffing

2. (character-stuffing)

3. Cyclic Redundancy Check(CRC)

4. sliding window protocol, and loss recovery using the Go-Back-N mechanism.

5. Dijikstra’s Algorithm

6. Implement broadcast tree for a given subnet of hosts

7. Take an example subnet graph with weights indicating delay between nodes. Now obtain routing table at each node using vector routing algorithm.

8. Take a 64 bit plain text and encrypt the same using DES algorithm. OR Decrypting DES.

9. Leaky bucket algorithm

10. Write a program for frame sorting technique used in buffers.

0 Comments

Menu Footer Widget

CN lab programs

1. bit-stuffing

2. (character-stuffing)

3. Cyclic Redundancy Check(CRC)

4. sliding window protocol, and loss recovery using the Go-Back-N mechanism.

5. Dijikstra’s Algorithm

6. Implement broadcast tree for a given subnet of hosts

7. Take an example subnet graph with weights indicating delay between nodes. Now obtain routing table at each node using vector routing algorithm.

8. Take a 64 bit plain text and encrypt the same using DES algorithm. OR Decrypting DES.

9. Leaky bucket algorithm

10. Write a program for frame sorting technique used in buffers.

You may like these posts

0 Comments

Follow Us

Menu Footer Widget