Scribd Logo
Upload

Welcome to Scribd!

  • 6 views

    Exp - 4 Os

    Uploaded by

    Param
    The document describes a program that implements the First Come First Serve (FCFS) CPU scheduling algorithm. It takes the arrival times and burst times of processes as input, calculates the waiting times, turnaround times, average waiting time and average turnaround time and prints a Gantt chart.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Exp - 4 Os

    Uploaded by

    Param
    6 views3 pages
    The document describes a program that implements the First Come First Serve (FCFS) CPU scheduling algorithm. It takes the arrival times and burst times of processes as input, calculates the waiting times, turnaround times, average waiting time and average turnaround time and prints a Gantt chart.

    Original Title

    EXP- 4 OS

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document describes a program that implements the First Come First Serve (FCFS) CPU scheduling algorithm. It takes the arrival times and burst times of processes as input, calculates the waiting times, turnaround times, average waiting time and average turnaround time and prints a Gantt chart.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    6 views3 pages

    Exp - 4 Os

    Uploaded by

    Param
    The document describes a program that implements the First Come First Serve (FCFS) CPU scheduling algorithm. It takes the arrival times and burst times of processes as input, calculates the waiting times, turnaround times, average waiting time and average turnaround time and prints a Gantt chart.

    Copyright:

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

    EXPERIMENT – 4

    AIM :- List of processes / jobs along with their arrival times &
    CPU burst times is given. Write a program to print the total
    waiting time, average waiting time, total turnaround time,
    average turnaround time & Gantt Chart using First Come First
    Serve(FCFS) CPU scheduling policy.

    PROGRAM:-
    #include<stdio.h>

    int main(){

    int bt[10]={0},at[10]={0},tat[10]={0},wt[10]={0},ct[10]={0};

    int n,sum=0;

    float totalTAT=0,totalWT=0;

    printf("Enter number of processes:- ");

    scanf("%d",&n);

    printf("Enter arrival time and burst time for each process\n\n");

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

    printf("Arrival time of process[%d] ",i+1);

    scanf("%d",&at[i]);

    printf("Burst time of process[%d] ",i+1);

    scanf("%d",&bt[i]);

    printf("\n");
    }

    for(int j=0;j<n;j++)

    sum+=bt[j];

    ct[j]+=sum;

    for(int k=0;k<n;k++)

    tat[k]=ct[k]-at[k];

    totalTAT+=tat[k];

    for(int k=0;k<n;k++)

    wt[k]=tat[k]-bt[k];

    totalWT+=wt[k];

    printf("Solution: \n\n");

    printf("P\t AT\t BT\t CT\t TAT\t WT\t\n\n");

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

    {
    printf("P%d\t %d\t %d\t %d\t %d\t %d\n",i+1,at[i],bt[i],ct[i],tat[i],wt[i]);

    printf("\n\nAverage Turnaround Time = %f\n",totalTAT/n);

    printf("Average WT = %f\n\n",totalWT/n);

    return 0;

    OUTPUT:-

    You might also like