Scribd
Upload
38 views1 page

Algorithm FCFS

The document outlines a step-by-step algorithm for calculating the waiting time and turnaround time for a set of processes in a scheduling system. It includes functions for computing waiting time, turnaround time, and average times, along with a main function that initializes process data and calls the average time function. The algorithm is structured in a clear, procedural format suitable for implementation in programming.

Uploaded by

Aman
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
38 views1 page

Algorithm FCFS

The document outlines a step-by-step algorithm for calculating the waiting time and turnaround time for a set of processes in a scheduling system. It includes functions for computing waiting time, turnaround time, and average times, along with a main function that initializes process data and calls the average time function. The algorithm is structured in a clear, procedural format suitable for implementation in programming.

Uploaded by

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

Start

Step 1-> In function int waiting time(int proc[], int n, int burst time[], int wait
time[])
Set wait time [0] = 0
Loop For i = 1 and i < n and i++
Set wait time[i] = burst time[i-1] + wait time[i-1]
End For
Step 2-> In function int turnaround time (int proc [], int n, int burst time [],
int wait time [], int tat[])
Loop For i = 0 and i< n and i++
Set tat [i] = burst time[i] + wait time[i]
End For
Step 3-> In function int avgtime( int proc[], int n, int burst time[])
Declare and initialize wait time[n], tat[n], total wt = 0, total_tat = 0;
Call waitingtime(proc, n, burst_time, wait_time)
Call turnaroundtime(proc, n, burst_time, wait_time, tat)
Loop For i=0 and i<n and i++
Set total_wt = total_wt + wait_time[i]
Set total_tat = total_tat + tat[i]
Print process number, burstime wait time and turnaround time
End For
Print "Average waiting time =i.e. total_wt / n
Print "Average turn around time = i.e. total_tat / n
Step 4-> In int main()
Declare the input int proc[] = { 1, 2, 3}
Declare and initialize n = sizeof proc / sizeof proc[0]
Declare and initialize burst_time[] = {10, 5, 8}
Call avgtime(proc, n, burst_time)
Stop

You might also like