C program for SJF CPU Scheduling Algorithm

by Ranjith | September 20th, 2009.

OUTPUT:
enter no of processes: 5

enter process1 name: aaa
enter process time: 4
enter process2 name: bbb
enter process time: 3
enter process3 name: ccc
enter process time: 2
enter process4 name: ddd
enter process time: 5
enter process5 name: eee
enter process time: 1

p_name P_time w_time

eee 1 0
ccc 2 1
bbb 3 3
aaa 4 6
ddd 5 10
total waiting time=20
avg waiting time=4.00

#include<stdio.h>
#include<conio.h>
#include<process.h>
void main()
{
char p[10][5],temp[5];
int tot=0,wt[10],pt[10],i,j,n,temp1;
float avg=0;
clrscr();
printf("enter no of processes:");
scanf("%d",&n);
for(i=0;i<n;i++)
{
printf("enter process%d name:\n",i+1);
scanf("%s",&p[i]);
printf("enter process time");
scanf("%d",&pt[i]);
}
for(i=0;i<n-1;i++)
{
for(j=i+1;j<n;j++)
{
if(pt[i]>pt[j])
{
temp1=pt[i];
pt[i]=pt[j];
pt[j]=temp1;
strcpy(temp,p[i]);
strcpy(p[i],p[j]);
strcpy(p[j],temp);
}
}
}
wt[0]=0;
for(i=1;i<n;i++)
{
wt[i]=wt[i-1]+et[i-1];
tot=tot+wt[i];
}
avg=(float)tot/n;
printf("p_name\t P_time\t w_time\n");
for(i=0;i<n;i++)
printf("%s\t%d\t%d\n",p[i],et[i],wt[i]);
printf("total waiting time=%d\n avg waiting time=%f",tot,avg);
getch();
}

OUTPUT:
enter no of processes: 5

p_name P_time w_time

eee 1 0
ccc 2 1
bbb 3 3
aaa 4 6
ddd 5 10
total waiting time=20
avg waiting time=4.00

Share and Enjoy:

16 Responses to “C program for SJF CPU Scheduling Algorithm”

1
dheeraj Says:
September 30th, 2009 at 7:07 pm
it is not working , it is not showing and taking the ‘time value’ for different process .pls sort out the problem and send the code to my id
2
CJ Says:
October 20th, 2009 at 3:21 pm
This program shows errors so plz correct it and send me.
3
jiten Says:
November 10th, 2009 at 8:14 pm
plz write the code in c++ for preemtive scheduling
4
anas Says:
December 24th, 2009 at 2:41 am
hi for all
this is the code after correct it
so thanks man you are great (Sorry for bag English)
#include
#include
#include

void main()
{

char p[10][5],temp[5];
int tot=0,wt[10],pt[10],i,j,n,temp1;
float avg=0;

cout<>n;
cout<<endl;

for(i=0;i<n;i++)
{
cout<<"Enter Process Name "<>p[i];
//cout<<endl;
cout<<"Enter Barst Time time for Process "<<p[i]<>pt[i];
cout<<endl;

}

for(i=0;i<n-1;i++)
{
for(j=i+1;jpt[j])
{
temp1=pt[i];
pt[i]=pt[j];
pt[j]=temp1;
strcpy(temp,p[i]);
strcpy(p[i],p[j]);
strcpy(p[j],temp);
}
}
}

wt[0]=0;
for(i=1;i<n;i++)
{
wt[i]=wt[i-1]+pt[i-1];
tot=tot+wt[i];
}
avg=(float)tot/n;

printf("p_name\t P_time\t w_time\n");

for(i=0;i<n;i++)
printf("%s\t%d\t%d\n",p[i],pt[i],wt[i]);
printf("total waiting time=%d\n avg waiting time=%f",tot,avg);

}
5
anas Says:
December 24th, 2009 at 2:47 am
sorry
When you paste the code Here it will Appear incorrectly
6
rrr Says:
January 3rd, 2010 at 1:03 pm
#include
#include
#include
void main()
{
char p[10][5];
int tot=0,wt[10],i,n;
float avg=0;
clrscr();
printf(“enter no of processes:”);
scanf(“%d”,&n);
for(i=0;i<n;i++)
{
printf("enter process%d name:\n",i+1);
scanf("%s",&p[i]);
printf("enter process time");
scanf("%d",&pt[i]);
}

wt[0]=0;
for(i=1;i<n;i++)
{
wt[i]=wt[i-1]+et[i-1];
tot=tot+wt[i];
}
avg=(float)tot/n;
printf("p_name\t P_time\t w_time\n");
for(i=0;i<n;i++)
printf("%s\t%d\t%d\n",p[i],et[i],wt[i]);
printf("total waiting time=%d\n avg waiting time=%f",tot,avg);
getch();
}
7
nalanda Says:
January 16th, 2010 at 12:14 pm
make sure uf da declarations….u msd to declare et array…..
8
Internet Banking Says:
February 4th, 2010 at 12:52 pm
Glad to see that this site works well on my Droid , everything I want to do is functional. Thanks for keeping it up to date with the latest.
9
sumit tripathi Says:
February 18th, 2010 at 9:38 am
#include
#include
#include
void main()
{
char p[10][5],temp[5];
int tot=0,wt[10],pt[10],i,j,n,temp1;
float avg=0;
clrscr();
printf(“enter no of processes:”);
scanf(“%d”,&n);
for(i=0;i<n;i++)
{
printf("enter process%d name:\n",i+1);
scanf("%s",&p[i]);
printf("enter process time");
scanf("%d",&pt[i]);
}
for(i=0;i<n-1;i++)
{
for(j=i+1;jpt[j])
{
temp1=pt[i];
pt[i]=pt[j];
pt[j]=temp1;
strcpy(temp,p[i]);
strcpy(p[i],p[j]);
strcpy(p[j],temp);
}
}
}
wt[0]=0;
for(i=1;i<n;i++)
{
wt[i]=wt[i-1]+et[i-1];
tot=tot+wt[i];
}
avg=(float)tot/n;
printf("p_name\t P_time\t w_time\n");
for(i=0;i<n;i++)
printf("%s\t%d\t%d\n",p[i],et[i],wt[i]);
printf("total waiting time=%d\n avg waiting time=%f",tot,avg);
getch();
}
10
pru Says:
March 11th, 2010 at 11:41 pm
all these prog has been made by avoiding arrival time.please take that into consideration
11
JAGADHEESWAR Says:
March 14th, 2010 at 10:25 am
HI THIS IS JAGADHEESWAR.VERY VERY THANKS FOR PUBLISHING THE C PROGRAMS IN THIS WEBSITE. I HAVE JAVA LAB PROGRAMS FOR JNTU BTECH STUDENTS WHICH HAS BEEN EXECUTED. (34 PROGRAMS). IF YOU WANT THAT I WILL SEND IT AS A MAIL TO YOU. VERY THANKS FOR PUBLISHING OS SCHEDULING ALGORITHMS . THANKYOU.
12
JAGADHEESWAR Says:
March 14th, 2010 at 10:32 am
Sir, how can i create a mini project for jntu.please send the details.
13
denz Says:
May 19th, 2010 at 3:12 pm
could you please send those programs to me. because i need some
references on my os class..specially the shortest job first program.
thanks alot. any program will be highly appreciated.
14
denz Says:
May 19th, 2010 at 3:14 pm
by the way i’m using a cygwin compiler. thanks
15
Priyanka Aggarwal Says:
June 1st, 2010 at 6:09 pm
// A program of sjf algorithm with no preemption

#include
#include
main()
{
int p[10],wt[10],bt[10],tat[10],i,j,twt=0,ttat=0,temp,n;
float awt,atat;
clrscr();
printf(“enter the no. of process=>\n”);
scanf(“%d”,&n);
printf(“enter process=>\n”);
for(i=0;i”);
for(i=0;i<n;i++)
{
scanf("%d",&bt[i]);
}
for(i=0;i<n;i++)
{
for(j=0;jbt[j+1])
{
temp=p[j];
p[j]=p[j+1];
p[j+1]=temp;

temp=bt[j];
bt[j]=bt[j+1];
bt[j+1]=temp;
}
}
}

wt[0]=0;
for(i=1;i<n;i++)
{
wt[i]=wt[i-1]+bt[i-1]; //waiting time
twt=twt+wt[i]; //total waiting time
}
for(i=0;i<n;i++)
{
tat[i]=wt[i]+bt[i]; //turn around time
ttat=ttat+tat[i]; // total turned around time
}
awt=(float)twt/n; //avg waiting time
atat=(float)ttat/n; //avg turn around time
printf("p_number\t P_bt\t p_wt \t p_tat \n");
for(i=0;i<n;i++)
printf("%d\t\t%d\t%d\t%d\n",p[i],bt[i],wt[i],tat[i]);
printf("total waiting time=%d\n avg waiting time=%f",twt,awt);
printf("\ntotal turnedaroundtime=%d\n avg turnedaround time=%f",ttat,atat);
getch();
}
16
dinesh Says:
July 27th, 2010 at 12:49 pm
sir ur program is not print the avg time and turn around time properly

C program for SJF CPU Scheduling Algorithm

16 Responses to “C program for SJF CPU Scheduling Algorithm”

Leave a Reply

Share and enjoy

RELATED ARTICLES

C program to implement tower of Hanoi problem

C program for sorting a Linked List

C program to Implement Morse code to text conversion and vice-versa.

C program to calculate the GCD of a number

C program for Syntax Analyzer

C program for Shortest Job Next

C program for Round Robin

C program for Priority Scheduling

C program for Pass-1 Assembler

C program for Operator Precedence

Microcontroller

Basic Electronics

Computer Programming

C/C++ Source Codes

Seminar Resources

SQL Books

Java Books

C++ Books

Introduction to PCI protocol

Stepper Motor Chopping Driver

Circuit Troubleshooting