Breaking News: Grepper is joining You.com. Read the official announcement!

first come first serve in cpp

Crazy Cassowary answered on December 15, 2022 Popularity 3/10 Helpfulness 1/10

answer first come first serve in cpp

first come first serve in cpp

Comment

#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;
}

Popularity 3/10 Helpfulness 1/10 Language cpp

Source: scanftree.com

Tags: c++ serve

Link to this answer
Share Copy Link

Contributed on Dec 15 2022

Crazy Cassowary

0 Answers Avg Quality 2/10

Continue with Google

By continuing, I agree that I have read and agree to Greppers's Terms of Service and Privacy Policy.

first come first serve in cpp

Contents

More Related Answers

first come first serve in cpp

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.