C++ Program for First Come First Served (FCFS) Scheduling Algorithm


Levels of difficulty: / perform operation:

For Algorithm and example
Go to operating system –> FCFS

C++ Program for FCFS

#include<iostream>
using namespace std;
int main() {
	int n,bt[20],wt[20],tat[20],avwt=0,avtat=0,i,j;
	cout<<"Enter total number of processes(maximum 20):";
	cin>>n;
	cout<<"nEnter Process Burst Timen";
	for (i=0;i<n;i++) {
		cout<<"P["<<i+1<<"]:";
		cin>>bt[i];
	}
	wt[0]=0;
	//waiting time for first process is 0
	//calculating waiting time
	for (i=1;i<n;i++) {
		wt[i]=0;
		for (j=0;j<i;j++)
		            wt[i]+=bt[j];
	}
	cout<<"nProcessttBurst TimetWaiting TimetTurnaround Time";
	//calculating turnaround time
	for (i=0;i<n;i++) {
		tat[i]=bt[i]+wt[i];
		avwt+=wt[i];
		avtat+=tat[i];
		cout<<"nP["<<i+1<<"]"<<"tt"<<bt[i]<<"tt"<<wt[i]<<"tt"<<tat[i];
	}
	avwt/=i;
	avtat/=i;
	cout<<"nnAverage Waiting Time:"<<avwt;
	cout<<"nAverage Turnaround Time:"<<avtat;
	return 0;
}





Quantitative Aptitude
Reasoning
Programming
Interview