Scribd Logo
Upload

Welcome to Scribd!

  • 117 views

    Source Code: Q5.Write A C Code To Implement SJF (Non-Preemptive) For 1. Arrival Time Is Not Given

    Uploaded by

    harshit Chaturvedi
    The C code implements the non-preemptive shortest job first (SJF) scheduling algorithm. It takes the burst time of each process as input, sorts them in ascending order, and calculates the waiting time and turnaround time for each process. It outputs the waiting time, turnaround time, and average waiting and turnaround times.

    Copyright:

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

    Source Code: Q5.Write A C Code To Implement SJF (Non-Preemptive) For 1. Arrival Time Is Not Given

    Uploaded by

    harshit Chaturvedi
    117 views6 pages
    The C code implements the non-preemptive shortest job first (SJF) scheduling algorithm. It takes the burst time of each process as input, sorts them in ascending order, and calculates the waiting time and turnaround time for each process. It outputs the waiting time, turnaround time, and average waiting and turnaround times.

    Original Title

    HarshitChaturvedi_Oslab5

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The C code implements the non-preemptive shortest job first (SJF) scheduling algorithm. It takes the burst time of each process as input, sorts them in ascending order, and calculates the waiting time and turnaround time for each process. It outputs the waiting time, turnaround time, and average waiting and turnaround times.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    117 views6 pages

    Source Code: Q5.Write A C Code To Implement SJF (Non-Preemptive) For 1. Arrival Time Is Not Given

    Uploaded by

    harshit Chaturvedi
    The C code implements the non-preemptive shortest job first (SJF) scheduling algorithm. It takes the burst time of each process as input, sorts them in ascending order, and calculates the waiting time and turnaround time for each process. It outputs the waiting time, turnaround time, and average waiting and turnaround times.

    Copyright:

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

    Q5.

    Write a C code to implement SJF (Non-preemptive) for


    1. Arrival time is not given.

    SOURCE CODE

    #include<stdio.h>

    void main()
    {
    int bt[20],p[20],wt[20],tat[20],i,j,n,total=0,pos,temp;
    float avg_wt,avg_tat;
    printf("Enter number of process:");
    scanf("%d",&n);

    printf("\nEnter Burst Time:\n");


    for(i=0;i<n;i++)
    {
    printf("p%d:",i+1);
    scanf("%d",&bt[i]);
    p[i]=i+1; //contains process number
    }

    //sorting burst time in ascending order using selection sort


    for(i=0;i<n;i++)
    {
    pos=i;
    for(j=i+1;j<n;j++)
    {
    if(bt[j]<bt[pos])
    pos=j;
    }

    temp=bt[i];
    bt[i]=bt[pos];
    bt[pos]=temp;

    temp=p[i];
    p[i]=p[pos];
    p[pos]=temp;
    }

    wt[0]=0; //waiting time for first process will be zero

    Harshit Chaturvedi Sec – C 27/1018494


    //calculate waiting time
    for(i=1;i<n;i++)
    {
    wt[i]=0;
    for(j=0;j<i;j++)
    wt[i]+=bt[j];

    total+=wt[i];
    }

    avg_wt=(float)total/n; //average waiting


    time total=0;

    printf("\nProcess\t Burst Time \tWaiting Time\tTurnaround Time");


    for(i=0;i<n;i++)
    {
    tat[i]=bt[i]+wt[i]; //calculate turnaround time
    total+=tat[i];
    printf("\np%d\t\t %d\t\t %d\t\t\t%d",p[i],bt[i],wt[i],tat[i]);
    }

    avg_tat=(float)total/n; //average turnaround time


    printf("\n\nAverage Waiting Time=%f",avg_wt);
    printf("\nAverage Turnaround Time=%f\n",avg_tat);
    }

    Harshit Chaturvedi Sec – C 27/1018494


    OUTPUT

    2. Arrival time is given.

    SOURCE CODE
    #include<stdio.h>
    int main()
    {
    int i,n,p[10]={1,2,3,4,5,6,7,8,9,10},min,k=1,btime=0;
    int bt[10],temp,j,at[10],wt[10],tt[10],ta=0,sum=0;
    float wavg=0,tavg=0,tsum=0,wsum=0;
    printf(" -------Shortest Job First Scheduling ( NP )-------\n");
    printf("\nEnter the No. of processes :");
    scanf("%d",&n);

    for(i=0;i<n;i++)
    {
    printf("\tEnter the burst time of %d process :",i+1);
    scanf(" %d",&bt[i]);
    Harshit Chaturvedi Sec – C 27/1018494
    printf("\tEnter the arrival time of %d process :",i+1);
    scanf(" %d",&at[i]);
    }

    /*Sorting According to Arrival Time*/

    for(i=0;i<n;i++)
    {
    for(j=0;j<n;j++)
    {
    if(at[i]<at[j])
    {
    temp=p[j];
    p[j]=p[i];
    p[i]=temp;
    temp=at[j];
    at[j]=at[i];
    at[i]=temp;
    temp=bt[j];
    bt[j]=bt[i];
    bt[i]=temp;
    }
    }
    }

    //Arranging the table according to Burst time,Execution time and Arrival Time Arrival
    time <= Execution time

    Harshit Chaturvedi Sec – C 27/1018494


    for(j=0;j<n;j++)
    {
    btime=btime+bt[j];
    min=bt[k];
    for(i=k;i<n;i++)
    {
    if (btime>=at[i] && bt[i]<min)
    {
    temp=p[k];
    p[k]=p[i];
    p[i]=temp;
    temp=at[k];
    at[k]=at[i];
    at[i]=temp;
    temp=bt[k];
    bt[k]=bt[i];
    bt[i]=temp;
    }
    } k+
    +;
    }
    wt[0]=0;
    for(i=1;i<n;i++)
    {
    sum=sum+bt[i-1];
    wt[i]=sum-at[i];
    wsum=wsum+wt[i];
    }

    wavg=(wsum/n);
    for(i=0;i<n;i++)
    {
    ta=ta+bt[i];
    tt[i]=ta-at[i];
    tsum=tsum+tt[i];
    }

    tavg=(tsum/n);

    printf("************************");
    printf("\n RESULT:-");
    printf("\nProcess\t Burst\t Arrival\t Waiting\t Turn-around" );
    for(i=0;i<n;i++)

    Harshit Chaturvedi Sec – C 27/1018494


    {
    printf("\n p%d\t %d\t %d\t\t %d\t\t\t%d",p[i],bt[i],at[i],wt[i],tt[i]);
    }

    printf("\n\nAVERAGE WAITING TIME : %f",wavg);


    printf("\nAVERAGE TURN AROUND TIME : %f",tavg);
    return 0;
    }

    OUTPUT

    Harshit Chaturvedi Sec – C 27/1018494

    You might also like