Comments on: C program for Priority Scheduling

By: rani

rani — Tue, 31 Jan 2012 09:46:54 +0000

// non preemitive algorithm

#include
#include
void main()
{
int n,p[10],b[10],i,j,temp,temp1,pr[10],q[10];
float c,s=0.0;
clrscr();
printf(“Enter the no. of process\n”);
scanf(“%d”,&n);
printf(“Enter processes\n”);
for(i=0;i {
scanf("%d",&p[i]);
}
printf("Enter brust time\n");
for(i=0;i {
scanf("%d",&b[i]);
}
printf("Enter the priority\n");
for(i=0;i {
scanf("%d",&pr[i]);
}
for(i=0;i {
for(j=1;j {
temp=pr[i];
temp1=p[i];
pr[i]=pr[j];
p[i]=p[j];
pr[j]=temp;
p[j]=temp1;
}
}
for(i=0;i {
printf("process is %d and it's Priority is %d\n",p[i],pr[i]);
}
p[0]=0;
for(i=0;i {
p[i+1]=p[i]+b[i];
printf("Waiting time=%d\n",p[i]);
}
for(i=0;i {
s=s+p[i];
}
c=s/n;
printf("Average waiting time=%f",c);
getch();
}

By: jaya pandey

jaya pandey — Wed, 25 Jan 2012 09:24:29 +0000

kal mera birthday hai……..

By: anish kamadana

anish kamadana — Mon, 09 Jan 2012 10:09:47 +0000

chaaaaaaaa

By: honey

honey — Wed, 21 Dec 2011 17:26:41 +0000

i want simple code for sjf preemptive

By: Randhir Singh

Randhir Singh — Wed, 30 Nov 2011 18:55:55 +0000

By: shadab

shadab — Mon, 28 Nov 2011 12:07:54 +0000

sir,
i want a program for priority scheduling by which we can solve response time also.
i want it asap…its really urgent.
if smebody knws please post it or send me a copy to my ,ail.

By: Anagh Vijayvargia

Anagh Vijayvargia — Thu, 24 Nov 2011 15:14:07 +0000

/*The correct one is this for priority cpu sheduling
by :anaghvj*/
#include
#include
#include
void main()
{
int temp1,n,p[10],pp[10],pt[10],w[10],t[10],awt,atat,i,j;
clrscr();
printf(“Enter the number of process :” );
scanf(“%d”,&n);
printf(“\n Enter process &: time priorities \n”);
for(i=0;i {
printf("\nProcess no %d : ",i+1);
scanf("%d %d",&pt[i],&pp[i]);
p[i]=i+1;
}
for(i=0;i {
for(j=i+1;jpp[j])
{
temp1=pp[i];
pp[i]=pp[j];
pp[j]=temp1;
temp1=pt[i];
pt[i]=pt[j];
pt[j]=temp1;
temp1=p[i];
p[i]=p[j];
p[j]=temp1;
}
}
}
w[0]=0;
awt=0;
t[0]=pt[0];
atat=t[0];
for(i=1;i {
w[i]=t[i-1];
awt+=w[i];
t[i]=w[i]+pt[i];
atat+=t[i];
}
printf("\n\n Job \t Burst Time \t Wait Time \t Turn Around Time Priority \n");
for(i=0;i printf("\n %d \t\t %d \t\t %d \t\t %d \t\t %d \n",p[i],pt[i],w[i],t[i],pp[i]);
awt/=n;
atat/=n;
printf("\n Average Wait Time : %d \n",awt);
printf("\n Average Turn Around Time : %d \n",atat);
getch();
}

By: praneetha

praneetha — Sat, 22 Oct 2011 12:46:51 +0000

I need a easy implementation of LRU(least recently used) page replacement algorithm

By: shanu

shanu — Mon, 26 Sep 2011 10:01:56 +0000

we need fcfs sjf round robin n priority scheduling pgm tat should be v simple……make it as earlier as possible………………pls

By: Prasad koranne

Prasad koranne — Tue, 20 Sep 2011 10:54:20 +0000

hi thank u for giving me your code
i m from MIT college aurangabad
this is an re-designed code for the Priority job scheduling program using the C language

#include
#include
void main()
{

int x,n,p[10],pp[10],pt[10],w[10],t[10],awt,att,i,j;
clrscr();
printf(“Enter the number of process : “);
scanf(“%d”,&n);

for(i=0;i {
printf("\nProcess no %d : ",i+1);
scanf("%d" ,&pt[i]);
printf("\ntime priorities :");
scanf("%d",&pp[i]);
p[i]=i+1;
}
for(i=0;i {
for(j=i+1;j {
if(pp[i] {
x=pp[i];
pp[i]=pp[j];
pp[j]=x;
x=pt[i];
pt[i]=pt[j];
pt[j]=x;
x=p[i];
p[i]=p[j];
p[j]=x;
}
}
}
w[0]=0;
awt=0;
t[0]=pt[0];
att=t[0];
for(i=1;i {
w[i]=t[i-1];
awt+=w[i];
t[i]=w[i]+pt[i];
att+=t[i];
}
printf("\n\n Job \t Burst Time \t Wait Time \t Turn Around Time Priority \n");
for(i=0;i printf("\n %d \t\t %d \t\t %d \t\t %d \t\t %d \n",p[i],pt[i],w[i],t[i],pp[i]);
awt/=n;
att/=n;
printf("\n Average Wait Time : %d \n",awt);
printf("\n Average Turn Around Time : %d \n",att);
getch();
}