Scribd
Upload
59 views13 pages

A-1 36 VEDANT OSL Assignment

The document defines an Algorithm class to implement and compare different CPU scheduling algorithms (FCFS, SJF, Priority, Round Robin) on a set of processes. It contains arrays to store process details like burst time, arrival time, priority. Methods like FCFS(), Priority() sort processes based on criteria and call common Algo() method to calculate waiting time, turnaround time and display results. Main runs a loop taking user input to run a chosen algorithm.

Uploaded by

Pranay Parekar
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
59 views13 pages

A-1 36 VEDANT OSL Assignment

The document defines an Algorithm class to implement and compare different CPU scheduling algorithms (FCFS, SJF, Priority, Round Robin) on a set of processes. It contains arrays to store process details like burst time, arrival time, priority. Methods like FCFS(), Priority() sort processes based on criteria and call common Algo() method to calculate waiting time, turnaround time and display results. Main runs a loop taking user input to run a chosen algorithm.

Uploaded by

Pranay Parekar
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/ 13

OS Assignment

36_VEDANT KULKARNI

#include<iostream>
using namespace std;

int process[]={1,2,3};
int AT[]={3,0,9};
int BT[]={3,5,10};
int rem_BT[]={3,5,10};
int WT[]={0,0,0};
int TAT[]={0,0,0};
int priority[]={2,1,3};

class Algorithm
{
public:
// void Algo();

void FCFS()
{

int i,j,temp;
for(i=0;i<3;i++)
{
for(j=i+1;j<3;j++)
{
if(AT[i]>AT[j])
{
temp=AT[i];
AT[i]=AT[j];
AT[j]=temp;

temp=priority[i];
priority[i]=priority[j];
priority[j]=temp;

temp=process[i];
process[i]=process[j];
process[j]=temp;

temp=BT[i];
BT[i]=BT[j];
BT[j]=temp;
}
}
}
cout<<"\nSorted on FCFS"<<endl;
for(i=0;i<3;i++)
{
cout<<process[i],BT[i],AT[i];
}
Algo();
}

void Priority()
{
int i,j,temp;
for(i=0;i<3;i++)
{
for(j=i+1;j<3;j++)
{
if(priority[i]>priority[j])
{
temp=priority[i];
priority[i]=priority[j];
priority[j]=temp;

temp=process[i];
process[i]=process[j];
process[j]=temp;

temp=BT[i];
BT[i]=BT[j];
BT[j]=temp;
}
}
}
cout<<"\nSorted on priority"<<endl;
for(i=0;i<3;i++)
{
cout<<process[i],BT[i],priority[i];
}
Algo();
}

void SJF()
{
float avg_WT=0;
float avg_TAT=0;
int temp;
int i,j;
for(i=0;i<3;i++)
{
for(j=i+1;j<3;j++)
{
if(BT[i]>BT[j])
{
temp=BT[i];
BT[i]=BT[j];
BT[j]=temp;
temp=process[i];
process[i]=process[j];
process[j]=temp;
}
}
}
cout<<"\nSorted on BT"<<endl;
for(i=0;i<3;i++)
{
cout<<process[i],BT[i];
}
Algo();
}

void round_robin()
{
int temp;
for(int i=0;i<3;i++)
{
for(int j=i+1;j<3;j++)
{
if(AT[i]>AT[j])
{
temp=AT[i];
AT[i]=AT[j];
AT[j]=temp;

temp=priority[i];
priority[i]=priority[j];
priority[j]=temp;

temp=process[i];
process[i]=process[j];
process[j]=temp;

temp=BT[i];
BT[i]=BT[j];
BT[j]=temp;
}
}
}
cout<<"\nSorted on FCFS"<<endl;
for(int i=0;i<3;i++)
{
cout<<process[i],BT[i],AT[i];
}
int quantum;
float avg_TAT, avg_WT;
cout<<"\nEnter the time quantum:- "<<endl;
cin>>quantum;
int t = 0;
while (1)
{
bool done = true;
for (int i = 0 ; i < 3; i++)
{
if (rem_BT[i] > 0)

{
done = false;
if (rem_BT[i] > quantum)
{
t += quantum;
rem_BT[i] -= quantum;

}
else
{
t = t + rem_BT[i];
WT[i] = t - BT[i];
rem_BT[i] = 0;
}
}
}
if (done == true)
break;
}
for (int i=0;i<3;i++)
{
TAT[i] = BT[i] +WT[i];
}

for (int i=0; i<3; i++)


{

avg_WT= avg_WT + WT[i];


avg_TAT=avg_TAT + TAT[i];
}
avg_WT=avg_WT/3;
avg_TAT=avg_TAT/3;
cout<<"\
n------------------------------------------------------------------------------------------"<<endl;
cout<<"\nProcess\t Arrival-Time\t Burst-time\t Waiting-time\t Turnaround-time\t
Priority"<<endl;
cout<<"\
n-------------------------------------------------------------------------------------------"<<endl;
for(int i=0;i<3;i++)
{
cout<<"\n"<<process[i]<< "\t \t"<<AT[i]<<"\t \t"<<BT[i]<<"\t \
t"<<WT[i]<<"\t \t"<<TAT[i]<<"\t \t"<<priority[i];
}
cout<<"\
n-------------------------------------------------------------------------------------------"<<endl;
cout<<"\n Average Waiting Time = "<<avg_WT;
cout<<"\n Average Turn-around Time = "<<avg_TAT;
cout<<"\n \n"<<endl;

cout<<"The gannt chart of Round Robin can't be printed as the time quantum is
same"<<endl;
/*for(int i=0;i<3;i++)
{
cout<<"|";
for (int j=0;j<[i];j++)
{
cout<<"-";
}
}
cout<<"|";
cout<<"\n";
cout<<"\n";*/
}
void Algo()
{
float avg_WT=0;
float avg_TAT=0;
int i,j;
WT[0]=0;
TAT[0]=BT[0]+WT[0];
avg_TAT=TAT[0];
for(i=1;i<3;i++)
{
WT[i]=WT[i-1]+BT[i-1];
TAT[i]=BT[i]+WT[i];
avg_WT=avg_WT+WT[i];
avg_TAT=avg_TAT+TAT[i];
}
avg_WT=avg_WT/3;
avg_TAT=avg_TAT/3;
cout<<"\
n------------------------------------------------------------------------------------------"<<endl;
cout<<"\nProcess\t Arrival-Time\t Burst-time\t Waiting-time\t Turnaround-
time\t Priority"<<endl;
cout<<"\
n-------------------------------------------------------------------------------------------"<<endl;
for(i=0;i<3;i++)
{
cout<<"\n"<<process[i]<< "\t \t"<<AT[i]<<"\t \t"<<BT[i]<<"\t \
t"<<WT[i]<<"\t \t"<<TAT[i]<<"\t \t"<<priority[i];
}
cout<<"\
n-------------------------------------------------------------------------------------------"<<endl;
cout<<"\n Average Waiting Time = "<<avg_WT;
cout<<"\n Average Turn-around Time = "<<avg_TAT;
cout<<"\n \n"<<endl;
for(i=0;i<3;i++)
{
cout<<"|";
for (j=0;j<BT[i];j++)
{
cout<<"-";
}
}
cout<<"|";
cout<<"\n";
cout<<"\n";
}
};

int main()
{
Algorithm ob;
int choice;
while(1)
{
cout<<"\n-----SCHEDULING ALOGRITHM-----"<<endl;
cout<<"\n 1.FCFS"<<endl;
cout<<"\n 2.Shortest Job First"<<endl;
cout<<"\n 3.Priority"<<endl;
cout<<"\n 4.Round Robin"<<endl;
cout<<"\n 5. Exit"<<endl;
cout<<"\nEnter your choice: "<<endl;
cin>>choice;
switch(choice)
{
case 1:
ob.FCFS();
break;
case 2:
ob.SJF();
break;
case 3:
ob.Priority();
break;
case 4:
ob.round_robin();
break;
case 5:
exit(1);
default:
cout<<"\n Invalid Choice!"<<endl;
}
}

return 0;
}

You might also like