Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 7 views

    Os 2b

    Uploaded by

    cosmiclove7353
    The document contains code for calculating waiting time and turnaround time for processes using C programming. It takes the number of processes and their burst times as input, sorts the processes by burst time, then calculates the waiting time, turnaround time, average waiting time and average turnaround time.

    Copyright:

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

    Os 2b

    Uploaded by

    cosmiclove7353
    7 views1 page
    The document contains code for calculating waiting time and turnaround time for processes using C programming. It takes the number of processes and their burst times as input, sorts the processes by burst time, then calculates the waiting time, turnaround time, average waiting time and average turnaround time.

    Original Title

    os 2b

    Copyright

    © © All Rights Reserved

    Available Formats

    TXT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document contains code for calculating waiting time and turnaround time for processes using C programming. It takes the number of processes and their burst times as input, sorts the processes by burst time, then calculates the waiting time, turnaround time, average waiting time and average turnaround time.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Download as txt, pdf, or txt
    7 views1 page

    Os 2b

    Uploaded by

    cosmiclove7353
    The document contains code for calculating waiting time and turnaround time for processes using C programming. It takes the number of processes and their burst times as input, sorts the processes by burst time, then calculates the waiting time, turnaround time, average waiting time and average turnaround time.

    Copyright:

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

    #include<stdio.

    h>
    int main ()
    {
    int p[20], bt[20], wt[20], tat[20], i, k, n, temp;
    float wtavg,tatavg;
    printf("\nEnter the number of processes -- ");
    scanf("%d", &n);
    for(i=0;i<n;i++)
    {
    p[i]=i;
    printf("Enter Burst Time for Process %d -- ", i);
    scanf("%d", &bt[i]);
    }
    for(i=0;i<n;i++)
    for(k=i+1;k<n;k++)
    if(bt[i]>bt[k])
    {
    temp=bt[i];
    bt[i]=bt[k];
    bt[k]=temp;
    temp=p[i];
    p[i]=p[k];
    p[k]=temp;
    }
    wt[0] = wtavg = 0;
    tat[0] = tatavg = bt[0];
    for(i=1;i<n;i++)
    {
    wt[i] = wt[i-1] +bt[i-1];
    tat[i] = tat[i-1] +bt[i];
    wtavg = wtavg + wt[i];
    tatavg = tatavg + tat[i];
    }
    printf("\n PROCESS\tBURST-TIME\tWAITING-TIME\tTURNAROUND-TIME\n");
    for(i=0;i<n;i++)
    printf("\n P%d \t \t %d \t\t %d \t\t %d", p[i], bt[i], wt[i], tat[i]);
    printf("\nAverage Waiting Time -- %f", wtavg/n);
    printf("\nAverage Turnaround Time -- %f", tatavg/n);
    }

    You might also like