Scribd
Upload
8 views4 pages

Os Practical 1

The document outlines a practical assignment for a scheduling algorithm (FCFS) conducted by a student named Bhushan Shivaji Khade at Bharat College of Arts & Commerce. It includes Java code to calculate waiting time, turnaround time, and average times for a set of processes. The code demonstrates the implementation of the First-Come, First-Served scheduling algorithm with sample process data.

Uploaded by

harshita.bharatcollege
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
8 views4 pages

Os Practical 1

The document outlines a practical assignment for a scheduling algorithm (FCFS) conducted by a student named Bhushan Shivaji Khade at Bharat College of Arts & Commerce. It includes Java code to calculate waiting time, turnaround time, and average times for a set of processes. The code demonstrates the implementation of the First-Come, First-Served scheduling algorithm with sample process data.

Uploaded by

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

Bharat Friends Association’s

BHARAT COLLEGE OF ARTS & COMMERCE


Hendrepada, Kulgaon, Badlapur (W) 421 503
Reaccredited by NAAC with Grade “B” [2016 – 2021]

Practical No-01

Name:- Bhushan Shivaji Khade

Class:- SYCS

Aim:- Scheduling Algorithm (FCFS)

Code:-

import java.text.ParseException;

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];

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));

2
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);

Output:-

3
4

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy