Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
13 views3 pages

Non-Preemptive SJF Scheduling Code

The document is a C++ program that implements the Non-Preemptive Shortest Job First (SJF) scheduling algorithm. It takes input for the number of processes, their names, arrival times, and burst times, then calculates and displays the completion time, turnaround time, and waiting time for each process. The program sorts processes by arrival time and computes the necessary scheduling metrics accordingly.

Uploaded by

Vikrant Sharma
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
13 views3 pages

Non-Preemptive SJF Scheduling Code

The document is a C++ program that implements the Non-Preemptive Shortest Job First (SJF) scheduling algorithm. It takes input for the number of processes, their names, arrival times, and burst times, then calculates and displays the completion time, turnaround time, and waiting time for each process. The program sorts processes by arrival time and computes the necessary scheduling metrics accordingly.

Uploaded by

Vikrant Sharma
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

#include<string.

h>
#include<iostream>
using namespace std;

int getmin(int i,int n,int bt[])


{
int j,d,min=10000;
for(j=i;j<n;j++)
{
if(min>bt[j])
{min=bt[j];
d=j;
}
}
return d;
}

int main()

{
int i,j,n;
cout<<"enter the number of processes \n ";
cin>>n;
int at[n],bt[n],ct[n],wt[n],tt[n];
string pn[n];
cout<<"enter the processes name ,arrival time and burst time \n ";

for(i=0;i<n;i++)
{
cin>>pn[i]>>at[i]>>bt[i];
}
cout<<"\n The data you have entered is as follows:\n";
cout<<"PROCESS NAME \tARIVAL TIME \tBURST TIME \n";

for(i=0;i<n;i++)
{
cout<<"\t"<<pn[i]<<"\t\t"<<at[i]<<"\t\t"<<bt[i]<<"\n";
}
for(i=0;i<n;i++)

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

string k;

int t;

if(at[i]>at[j+1])

{t=at[i];

at[i]=at[j+1];

at[j+1]=t;

k=pn[i];

pn[i]=pn[j+1];

pn[j+1]=k;

t=bt[i];

bt[i]=bt[j+1];

bt[j+1]=t;

}
}
}

cout<<"arranged processes by Arival time \n ";

cout<<"PROCESS NAME \t ARIVAL TIME \t BURST TIME \n";

for(i=0;i<n;i++)
{
cout<<"\t"<<pn[i]<<"\t\t"<<at[i]<<"\t\t"<<bt[i]<<"\n";
}

cout<<"\n NP SJF with COMPLETION TIME \n";

ct[0]=bt[0];

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

if(ct[i-1]>at[i])

{ int d;

d=getmin(i,n,bt);

string k;

int t;

t=at[i];

at[i]=at[d];

at[d]=t;

k=pn[i];

pn[i]=pn[d];

pn[d]=k;

t=bt[i];

bt[i]=bt[d];

bt[d]=t;

ct[i]=ct[i-1]+bt[i];

else{

ct[i]=ct[i-1]+bt[i];

cout<<"PROCESS NAME \t COMPLETION TIME \n";

for(i=0;i<n;i++)
{
cout<<"\t"<<pn[i]<<"\t\t"<<ct[i]<<"\n";
}

cout<<"TURN AROUND TIME \n";

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

tt[i]=ct[i]-at[i];

wt[i]=tt[i]-bt[i];

cout<<"PROCESS NAME \t ARIVAL TIME \t BURST TIME \t COMPLETION TIME \t TURN AROUND TIME \t WAITING TIME \t \n";

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

cout<<"\t"<<pn[i]<<"\t\t"<<at[i]<<"\t\t"<<bt[i]<<"\t\t"<<ct[i]<<"\t\t\t"<<tt[i]<<"\t\t\t"<<wt[i]<<"\n";
}
return 0; }

You might also like