Scribd
Upload
3 views3 pages

Os Practical 1

The document outlines a practical assignment for SYCS students at Bharat College of Arts & Commerce, focusing on the First-Come, First-Served (FCFS) scheduling algorithm. It includes Java code for calculating waiting time and turnaround time for processes, along with average times. The assignment is part of the curriculum reaccredited by NAAC with a Grade 'B' from 2016 to 2021.

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 DOCX, PDF, TXT or read online on Scribd
3 views3 pages

Os Practical 1

The document outlines a practical assignment for SYCS students at Bharat College of Arts & Commerce, focusing on the First-Come, First-Served (FCFS) scheduling algorithm. It includes Java code for calculating waiting time and turnaround time for processes, along with average times. The assignment is part of the curriculum reaccredited by NAAC with a Grade 'B' from 2016 to 2021.

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 DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

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:- HAMMAD MULLA

Class:- SYCS

Aim:- Scheduling Algorithm (FCFS)

Code:-

import java.text.ParseException;

class gfg {

processes[], int n,

int bt[], int wt[])

wt[0] = 0;

for (int i = 1; i < n; i++)

{ wt[i] = bt[i - 1] + wt[i - 1];

static void findTurnAroundTime(int processes[],


int n,

int bt[],

int wt[],

int tat[]) {

for (int i = 0; i < n; i++) {

tat[i] = bt[i] + wt[i];

1
}

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;

findWaitingTime(processes, n, bt, wt);

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

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

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

public static void main(String[] args) throws ParseException {

int processes[] = {1, 2, 3};

int n = processes.length;

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

findavgTime(processes, n, burst_time);

Output:-

You might also like