AEx5

 Take an example subnet of hosts. Obtain broadcast tree for THE SUBNET.

#include<stdio.h>

#include<stdlib.h>

#define MAX_NODES 20

#define INFINITY 1000

void run_prim(int i,int num_nodes,int *hops);

int dist[MAX_NODES][MAX_NODES];

int path[MAX_NODES][MAX_NODES];

int main()

{

 int num_nodes=0;

 int i=0,j=0;

 int path_len,hops[MAX_NODES];


 printf("enter the number of nodes:");

 scanf("%d",&num_nodes);

 fflush(stdin);

 printf("enter the connection matrix, 0 if not connected\n");

 printf("otherwise,the distance\n");

 for(;i<num_nodes;i++)

 {

printf("enter the distances for node num:%d\n",i);

  for(j=0;j<num_nodes;j++)

  {

   if(i==j)

   {

    dist[i][j]=0;

    continue;

   }

   printf("distance from %d to %d= ",i,j);

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

   fflush(stdin);

   if(dist[i][j]==0) 

    dist[i][j]=INFINITY;

  }

 }


 printf("\nenter the root node");

 scanf("%d",&i);

 run_prim(i,num_nodes,hops);

 for(j=0;j<num_nodes;j++)

 {

  for(i=0;i<hops[j];i++)

   printf("->%d",path[j][i]);

  printf("\n");

 }

 return 0;

}

void run_prim(int s,int n,int *hops)

{

 struct state

 {

 int prev;

  int length;

  enum {perm,tent} label;

 }state[MAX_NODES];

 int i,j,k,min;

 int count=0;

 struct state *p;

 for(p=&state[0];p<&state[n];p++)

 {

  p->prev= -1;

  p->length= INFINITY;

  p->label= tent;

 } 

 state[s].length= 0;state[s].label= perm;

 k=s;

 do

 {

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

   if(dist[k][i]!=0&&state[i].label==tent)

   {

    if(state[k].length+dist[k][i]<state[i].length)

{

     state[i].prev=k;

     state[i].length=state[k].length+dist[k][i];

    }

   }

k=0;

  min=INFINITY;

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

   if(state[i].label==tent&&state[i].length<min)

   {

    min=state[i].length;

    k=i;

   }

  state[k].label=perm;

  count++;

 }while(count<n);


 for(j=0;j<n;j++)

 {

  i=0;k=j;

  do 

  { 

   path[j][i++]=k;

   k=state[k].prev;  

  }


  while(k>=0);

  hops[j]=i;

 }

}


Output:


enter the number of nodes:4

enter the connection matrix, 0 if not connected, otherwise the distance

enter the distances for node num:0

distance from 0 to 1= 2

distance from 0 to 2= 1

distance from 0 to 3= 6

enter the distances for node num:1

distance from 1 to 0= 5

distance from 1 to 2= 1

distance from 1 to 3= 3

enter the distances for node num:2

distance from 2 to 0= 5 

distance from 2 to 1= 1

distance from 2 to 3= 3

enter the distances for node num

:3

distance from 3 to 0= 5

distance from 3 to 1= 4

distance from 3 to 2= 6

enter the root node2

->0->2

->1->2

->2

->3->2

Comments

Post a Comment

Popular posts from this blog

Some code cn

 //Bit stuffing #include<stdio.h> #include<string.h> void main() { int a[20],b[30],i,j,k,count,n; printf("Enter frame length:"); scanf("%d",&n); printf("Enter input frame (0's & 1's only):"); for(i=0;i<n;i++) scanf("%d",&a[i]); i=0;  count=1; j=0; while(i<n) { if(a[i]==1) { b[j]=a[i]; for(k=i+1;a[k]==1 && k<n && count<5;k++) { j++; b[j]=a[k]; count++; if(count==5) { j++; b[j]=0; } i=k; } } else { b[j]=a[i]; } i++; j++; } printf("After stuffing the frame is:"); for(i=0;i<j;i++) printf("%d",b[i]); } Output: Enter frame length:5 Enter input frame (0's & 1's only): 1 1 1 1 1 After stuffing the frame is: 111110 //Byte stuffing #include<stdio.h> #include<string.h> #include<conio.h> void main() { int j,l,m,c,k; char a[50],b[50]; printf("Enter the string:"); scanf("%s",a); strcpy(b,"DLESTX"); m=strlen(a); for(j=0;...
Read more

Char count

 #include<stdio.h> #include<string.h> char input[10][20]; int get_input(); void make_frames(int); int count_chars(int s); void main() { int no_of_words=get_input(); make_frames(no_of_words); } int get_input() { int answer; int i=0; do{ printf("\nEnter the Word:"); scanf("%s",input[i]); fflush(stdin); printf("\nDo you want to continue: (yes: 1 or no: 0)?:"); scanf("%d",&answer); i++; } while(answer!=0); return i; } void make_frames(int num_words){ int i=0; printf("\nThe Transmitted Data is:\n\t"); for(;i<num_words;i++) printf("%d%s",(count_chars(i)+1),input[i]); printf("\n\n"); } int count_chars(int index) { int i=0; while(input[index][i]!='\0') i++; return i; } Output: Enter the Word:cat Do you want to continue: (y: 1/n: 0)?:1 Enter the Word:dog Do you want to continue: (y: 1/n: 0)?:1 Enter the Word:apple Do you want to continue: (y: 1/n: 0)?:0 The Transmitted Data is: 4cat4dog6apple
Read more

Fork

 #include<stdio.h> #include <unistd.h> #include<sys/types.h> int main() { int id,childid; id=getpid(); if((childid=fork())>0) { printf("\n i am in the parent process %d",id); printf("\n i am in the parent process %d",getpid()); printf("\n i am in the parent process %d\n",getppid()); } else { printf("\n i am in child process %d",id); printf("\n i am in the child process %d",getpid()); printf("\n i am in the child process %d",getppid()); }
Read more