program for sjf algoritham using c

SJF ALGORITHM

#include<stdio.h>

main()

{

int job[10],i,j,n,t,s[10],wt[10];

float sum=0.0;

printf("\nEnter no of jobs");

scanf("%d",&n);

printf("Enter burst time");

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

{

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

s[job[i]]=i;

}

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

for(j=0;j<n-(i+1);j++)

if(job[j]>job[j+1])

{

t=job[j];

job[j]=job[j+1];

job[j+1]=t;

}

printf("\nJOB\tEXECUTION TIME\t WAITING TIME\t TURN AROUND TIME");

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

{

sum+=job[i];

wt[i]=sum-job[i];

printf("\n%d\t%d\t\t%d\t\t%f",s[job[i]],job[i],wt[i],sum);

}

printf("\nmean time=%f",sum/n);

}

round robin algorithm program using c language

ROUND ROBIN ALGORITHM

#include<stdio.h>

main()

{

int a[20],b[20],c[20],i,j=0,n,d,bt=0,count,time,p,e;

clrscr();

printf("\nEnter no of jobs");

scanf("%d",&n);

printf("Enter burst time");

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

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

printf("Enter processing time");

scanf("%d",&time);

p=a[1];

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

if(p<a[i])

p=a[i];

count=p/time+1;

while(count>0)

{

count--;

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

if(a[i]>0)

{

if(a[i]>time)

{

d=time;

e=i;

a[i]=a[i]-time;

}

else

{

d=a[i];

e=i;

a[i]=a[i]-a[i];

}

j++;

b[j]=e;

c[j]=d;

}

}

printf("\nThe processing sequence is\n");

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

printf("p%d ",b[i]);

printf("\n");

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

printf("%2d",c[i]);

printf("\n");

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

{

bt=bt+c[i];

}

printf("\nTotal burst time=%d",bt);

}