Content-Length: 2976164 | pFad | https://www.scribd.com/document/426077840/For-fcfs

5 For Fcfs | PDF | Computer Programming | Object Oriented Programming
Scribd
Upload
333 views2 pages

For Fcfs

Uploaded by

burhan zob

This Java program implements the First Come First Serve (FCFS) scheduling algorithm. It contains functions to calculate the waiting time, turnaround time, total waiting time, total turnaround time, average waiting time and average turnaround time for a given set of processes with their burst times. The main function takes the process IDs, number of processes and their burst times as input and calls the findavgTime function to calculate and print the required metrics.

Copyright:

© All Rights Reserved
Download as DOCX, PDF, TXT or read online from Scribd
Download as docx, pdf, or txt

For Fcfs

Uploaded by

burhan zob
333 views2 pages
This Java program implements the First Come First Serve (FCFS) scheduling algorithm. It contains functions to calculate the waiting time, turnaround time, total waiting time, total turnaround time, average waiting time and average turnaround time for a given set of processes with their burst times. The main function takes the process IDs, number of processes and their burst times as input and calls the findavgTime function to calculate and print the required metrics.

Original Description:

;l

Original Title

For fcfs

Copyright

© © All Rights Reserved

Available Formats

DOCX, PDF, TXT or read online from Scribd

Did you find this document useful?

Is this content inappropriate?

This Java program implements the First Come First Serve (FCFS) scheduling algorithm. It contains functions to calculate the waiting time, turnaround time, total waiting time, total turnaround time, average waiting time and average turnaround time for a given set of processes with their burst times. The main function takes the process IDs, number of processes and their burst times as input and calls the findavgTime function to calculate and print the required metrics.

Copyright:

© All Rights Reserved
Download as DOCX, PDF, TXT or read online from Scribd
Download as docx, pdf, or txt
333 views2 pages

For Fcfs

Uploaded by

burhan zob
This Java program implements the First Come First Serve (FCFS) scheduling algorithm. It contains functions to calculate the waiting time, turnaround time, total waiting time, total turnaround time, average waiting time and average turnaround time for a given set of processes with their burst times. The main function takes the process IDs, number of processes and their burst times as input and calls the findavgTime function to calculate and print the required metrics.

Copyright:

© All Rights Reserved
Download as DOCX, PDF, TXT or read online from Scribd
Download as docx, pdf, or txt
You are on page 1/ 2

For fcfs

// Java program for implementation of FCFS


// scheduling

import java.text.ParseException;

public class GFG {

// Function to find the waiting time for all


// processes
static void findWaitingTime(int processes[], int n,
int bt[], int wt[]) {
// waiting time for first process is 0
wt[0] = 0;

// calculating waiting time


for (int i = 1; i < n; i++) {
wt[i] = bt[i - 1] + wt[i - 1];
}
}

// Function to calculate turn around time


static void findTurnAroundTime(int processes[], int n,
int bt[], int wt[], int tat[]) {
// calculating turnaround time by adding
// bt[i] + wt[i]
for (int i = 0; i < n; i++) {
tat[i] = bt[i] + wt[i];
}
}

//Function to calculate average time


static void findavgTime(int processes[], int n, int bt[]) {
int wt[] = new int[n], tat[] = new int[n];
int total_wt = 0, total_tat = 0;

//Function to find waiting time of all processes


findWaitingTime(processes, n, bt, wt);

//Function to find turn around time for all processes


findTurnAroundTime(processes, n, bt, wt, tat);

//Display processes along with all details


System.out.printf("Processes Burst time Waiting"
+" time Turn around time\n");

// Calculate total waiting time and total turn


// around time
for (int i = 0; i < n; i++) {
total_wt = total_wt + wt[i];
total_tat = total_tat + tat[i];
System.out.printf(" %d ", (i + 1));
System.out.printf(" %d ", bt[i]);
System.out.printf(" %d", wt[i]);
System.out.printf(" %d\n", tat[i]);
}
float s = (float)total_wt /(float) n;
int t = total_tat / n;
System.out.printf("Average waiting time = %f", s);
System.out.printf("\n");
System.out.printf("Average turn around time = %d ", t);
}

// Driver code
public static void main(String[] args) throws ParseException {
//process id's
int processes[] = {1, 2, 3};
int n = processes.length;

//Burst time of all processes


int burst_time[] = {10, 5, 8};

findavgTime(processes, n, burst_time);

}
}

You might also like









 ApplySandwichStrip

pFad - (p)hone/(F)rame/(a)nonymizer/(d)eclutterfier!      Saves Data!


--- a PPN by Garber Painting Akron. With Image Size Reduction included!

Fetched URL: https://www.scribd.com/document/426077840/For-fcfs

Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy