Scribd Logo
Upload

Welcome to Scribd!

  • 36 views

    REG - NO:18BCI0186: Operating System Da-2

    Uploaded by

    Aryan Vats
    The document discusses various scheduling algorithms: - First Come First Serve (FCFS) scheduling allocates processes based on arrival time, with no preemption. - Shortest Job First (SJF) scheduling selects the process with the shortest burst time to execute next. - Round Robin (RR) scheduling uses a time quantum to allow preemptive context switching between processes. - Priority scheduling can be preemptive or non-preemptive, selecting the process with the highest priority level to execute next.

    Copyright:

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

    REG - NO:18BCI0186: Operating System Da-2

    Uploaded by

    Aryan Vats
    36 views21 pages
    The document discusses various scheduling algorithms: - First Come First Serve (FCFS) scheduling allocates processes based on arrival time, with no preemption. - Shortest Job First (SJF) scheduling selects the process with the shortest burst time to execute next. - Round Robin (RR) scheduling uses a time quantum to allow preemptive context switching between processes. - Priority scheduling can be preemptive or non-preemptive, selecting the process with the highest priority level to execute next.

    Original Description:

    digital assignment vit vellore

    Original Title

    18BCI0186_VL2019201000892_AST02

    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 discusses various scheduling algorithms: - First Come First Serve (FCFS) scheduling allocates processes based on arrival time, with no preemption. - Shortest Job First (SJF) scheduling selects the process with the shortest burst time to execute next. - Round Robin (RR) scheduling uses a time quantum to allow preemptive context switching between processes. - Priority scheduling can be preemptive or non-preemptive, selecting the process with the highest priority level to execute next.

    Copyright:

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

    REG - NO:18BCI0186: Operating System Da-2

    Uploaded by

    Aryan Vats
    The document discusses various scheduling algorithms: - First Come First Serve (FCFS) scheduling allocates processes based on arrival time, with no preemption. - Shortest Job First (SJF) scheduling selects the process with the shortest burst time to execute next. - Round Robin (RR) scheduling uses a time quantum to allow preemptive context switching between processes. - Priority scheduling can be preemptive or non-preemptive, selecting the process with the highest priority level to execute next.

    Copyright:

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

     OPERATING SYSTEM DA-2

     REG.NO:18BCI0186
     NAME:P.ROHITH REDDY
     DATE:16-08-2019
     TOPIC: Scheduling Algo- Deadlock
     LAB-SLOT:L51+52
     FACULTY:SRIMATHI C
     COURSE CODE:CSE-2005
     COURSE NAME : OPERATING SYSTEM
    1.PROCESS CREATION :-
    ORPHAN PROCESS :
    ZOMBIE PROCESS :
    2. SCHEDULING ALGORITHMS

    (i)FCFS
    #include<stdio.h>

    int main()

    int n,bt[20],wt[20],tat[20],avwt=0,avtat=0,i,j;

    printf("Enter total number of processes(maximum 20):");

    scanf("%d",&n);

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

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

    printf("P[%d]:",i+1);

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

    wt[0]=0;

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

    wt[i]=0;

    for(j=0;j<i;j++)

    {
    wt[i]+=bt[j];

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

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

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

    avwt+=wt[i];

    avtat+=tat[i];

    printf("\nP[%d]\t\t%d\t\t%d\t\t%d",i+1,bt[i],wt[i],tat[i]);

    avwt/=i;

    avtat/=i;

    printf("\n\nAverage Waiting Time:%d",avwt);

    printf("\nAverage Turnaround Time:%d",avtat);

    return 0;

    }
    (ii) SJT

    #include<stdio.h>

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

    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;

    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;

    total=0;

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

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

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

    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;

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

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

    return 0;

    (iii)SRTF
    #include<stdio.h>

    #include<conio.h>

    #include<string.h>

    int main()

    int et[20],at[10],n,i,j,temp,st[10],ft[10],wt[10],ta[10];

    int totwt=0,totta=0;

    float awt,ata;

    char pn[10][10],t[10];

    printf("Enter the number of process:");

    scanf("%d",&n);

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

    printf("Enter process name, arrival time& execution time:");

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

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

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

    if(et[i]<et[j])

    temp=at[i];

    at[i]=at[j];
    at[j]=temp;

    temp=et[i];

    et[i]=et[j];

    et[j]=temp;

    strcpy(t,pn[i]);

    strcpy(pn[i],pn[j]);

    strcpy(pn[j],t);

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

    if(i==0)

    st[i]=at[i];

    else

    st[i]=ft[i-1];

    wt[i]=st[i]-at[i];

    ft[i]=st[i]+et[i];

    ta[i]=ft[i]-at[i];

    totwt+=wt[i];

    totta+=ta[i];

    awt=(float)totwt/n;

    ata=(float)totta/n;

    printf("\nPname\tarrivaltime\texecutiontime\twaitingtime\ttatime");
    for(i=0; i<n; i++)

    printf("\n%s\t%5d\t\t%5d\t\t%5d\t\t%5d",pn[i],at[i],et[i],wt[i],ta[i]);

    printf("\nAverage waiting time is:%f",awt);

    printf("\nAverage turnaroundtime is:%f",ata);

    getch();

    return 0;

    (iv) ROUND ROBIN

    #include<stdio.h>

    int main()
    {

    int count,j,n,time,remain,flag=0,time_quantum;

    int wait_time=0,turnaround_time=0,at[10],bt[10],rt[10];

    printf("Enter Total Process:\t ");

    scanf("%d",&n);

    remain=n;

    for(count=0;count<n;count++)

    printf("Enter Arrival Time and Burst Time for Process Process Number %d :",count+1);

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

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

    rt[count]=bt[count];

    printf("Enter Time Quantum:\t");

    scanf("%d",&time_quantum);

    printf("\n\nProcess\t|Turnaround Time|Waiting Time\n\n");

    for(time=0,count=0;remain!=0;)

    if(rt[count]<=time_quantum && rt[count]>0)

    time+=rt[count];

    rt[count]=0;

    flag=1;
    }

    else if(rt[count]>0)

    rt[count]-=time_quantum;

    time+=time_quantum;

    if(rt[count]==0 && flag==1)

    remain--;

    printf("P[%d]\t|\t%d\t|\t%d\n",count+1,time-at[count],time-at[count]-bt[count]);

    wait_time+=time-at[count]-bt[count];

    turnaround_time+=time-at[count];

    flag=0;

    if(count==n-1)

    count=0;

    else if(at[count+1]<=time)

    count++;

    else

    count=0;

    printf("\nAverage Waiting Time= %f\n",wait_time*1.0/n);

    printf("Avg Turnaround Time = %f",turnaround_time*1.0/n);


    return 0;

    }
    (v) PRIORITY SCHEDULING (Preemptive and Non-
    Preemptive)
    #include<stdio.h>

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

    printf("\nEnter Burst Time and Priority\n");


    for(i=0;i<n;i++)
    {
    printf("\nP[%d]\n",i+1);
    printf("Burst Time:");
    scanf("%d",&bt[i]);
    printf("Priority:");
    scanf("%d",&pr[i]);
    p[i]=i+1
    }

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

    temp=pr[i];
    pr[i]=pr[pos];
    pr[pos]=temp;

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

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

    wt[0]=0;

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

    total+=wt[i];
    }

    avg_wt=total/n;
    total=0;

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


    for(i=0;i<n;i++)
    {
    tat[i]=bt[i]+wt[i];
    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=total/n;
    printf("\n\nAverage Waiting Time=%d",avg_wt);
    printf("\nAverage Turnaround Time=%d\n",avg_tat);

    return 0;
    }

    You might also like