Thursday 23 April 2015

Priority Scheduling program

/* Priority Scheduling */

#include<stdio.h>
#include<conio.h>
#include<stdio.h>
void main()
{
int P[10],BT[10],AT[10],Pri[10],WT[10],TA[10],s[10],e[10];
int i,j,N,temp1,temp2,temp3;
clrscr();
printf("Enter the no.of processes=");
scanf("%d",&N);
for(i=0;i<N;i++)
{
printf("\n\nEnter the pname, burst time & priority=\n");
printf("P");
scanf("%d%d%d",&P[i],&BT[i],&Pri[i]);
}
for(i=0;i<N;i++)
{
for(j=i+1;j<N;j++)
{
if(Pri[i]>Pri[j])
{
temp2=Pri[i];
Pri[i]=Pri[j];
Pri[j]=temp2;
temp1=BT[i];
BT[i]=BT[j];
BT[j]=temp1;
temp3=P[i];
P[i]=P[j];
P[j]=temp3;
}
}
}
printf("\n\nThe process table=\n\nPname\tBT\tPriority\tWT\tTA\n");
printf("___________________________________________________________\n");
s[0]=0;
e[0]=BT[0];
WT[0]=0;
TA[0]=BT[0];
printf("\nP%d\t%d\t%d\t%d\t%d",1,BT[0],Pri[0],WT[0],TA[0]);
for(i=1;i<N;i++)
{
e[i]=e[i-1]+BT[i];
WT[i]=e[i-1];
TA[i]=WT[i]+BT[i];
printf("\nP%d\t%d\t%d\t%d\t%d",P[i],BT[i],Pri[i],WT[i],TA[i]);
}
getch();
}

No comments:

Post a Comment