Scribd Logo
Upload

Welcome to Scribd!

  • 6 views

    Fifo

    Uploaded by

    Rahul Sonawane

    Copyright:

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

    Fifo

    Uploaded by

    Rahul Sonawane
    6 views2 pages

    Original Title

    fifo.doc

    Copyright

    © © All Rights Reserved

    Available Formats

    TXT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Copyright:

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

    Fifo

    Uploaded by

    Rahul Sonawane

    Copyright:

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

    #include<stdio.

    h>
    #define MAX 20

    int frames[MAX],ref[MAX],mem[MAX][MAX],faults,sp,m,n;

    void accept()
    {
    int i;

    printf("Enter no.of frames:");


    scanf("%d", &n);

    printf("Enter no.of references:");


    scanf("%d", &m);

    printf("Enter reference string:\n");


    for(i=0;i<m;i++)
    {
    printf("[%d]=",i);
    scanf("%d",&ref[i]);
    }
    }

    void disp()
    {
    int i,j;

    for(i=0;i<m;i++)
    printf("%3d",ref[i]);

    printf("\n\n");

    for(i=0;i<n;i++)
    {
    for(j=0;j<m;j++)
    {
    if(mem[i][j])
    printf("%3d",mem[i][j]);
    else
    printf(" ");
    }
    printf("\n");
    }

    printf("Total Page Faults: %d\n",faults);


    }

    int search(int pno)


    {
    int i;

    for(i=0;i<n;i++)
    {
    if(frames[i]==pno)
    return i;
    }

    return -1;
    }
    void fifo()
    {
    int i,j;

    for(i=0;i<m;i++)
    {
    if(search(ref[i])==-1)
    {
    frames[sp] = ref[i];
    sp = (sp+1)%n;
    faults++;
    for(j=0;j<n;j++)
    mem[j][i] = frames[j];

    }
    }
    }

    int main()
    {
    accept();
    fifo();
    disp();

    return 0;
    }

    You might also like