Scribd Logo
Upload

Welcome to Scribd!

  • 9 views

    Wa0004.

    Uploaded by

    ranjith630257

    Copyright:

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

    Wa0004.

    Uploaded by

    ranjith630257
    9 views8 pages

    Original Title

    DOC-20240507-WA0004.

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Copyright:

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

    Wa0004.

    Uploaded by

    ranjith630257

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    You are on page 1of 8

    Optimal page replacement

    #Include<stdio.h>

    Int main(){

    Int no_of_frames, no_of_pages, frames[10], pages[30], temp[10], flag1, flag2, flag3, I, j, k,


    pos, max, faults = 0;

    Printf(“Enter number of frames: “);

    Scanf(“%d”, &no_of_frames)

    Printf(“Enter number of pages: “);

    Scanf(“%d”, &no_of_pages);

    Printf(“Enter page reference string: “);

    For(I = 0; I < no_of_pages; ++i){

    Scanf(“%d”, &pages[i]);

    For(I = 0; I < no_of_frames; ++i){

    Frames[i] = -1;

    For(I = 0; I < no_of_pages; ++i){

    Flag1 = flag2 = 0;

    For(j = 0; j < no_of_frames; ++j){

    If(frames[j] == pages[i]){

    Flag1 = flag2 = 1;

    Break;

    If(flag1 == 0){

    For(j = 0; j < no_of_frames; ++j){


    If(frames[j] == -1){

    Faults++;

    Frames[j] = pages[i];

    Flag2 = 1;

    Break;

    If(flag2 == 0){

    Flag3 =0;

    For(j = 0; j < no_of_frames; ++j){

    Temp[j] = -1;

    For(k = I + 1; k < no_of_pages; ++k){

    If(frames[j] == pages[k]){

    Temp[j] = k;

    Break;

    For(j = 0; j < no_of_frames; ++j){

    If(temp[j] == -1){

    Pos = j;

    Flag3 = 1;
    Break;

    If(flag3 ==0){

    Max = temp[0];

    Pos = 0;

    For(j = 1; j < no_of_frames; ++j){

    If(temp[j] > max){

    Max = temp[j];

    Pos = j;

    Frames[pos] = pages[i];

    Faults++;

    Printf(“\n”);

    For(j = 0; j < no_of_frames; ++j){

    Printf(“%d\t”, frames[j]);

    Printf(“\n\nTotal Page Faults = %d”, faults);

    Return 0;

    Output
    Enter number of frames: 3

    Enter number of pages: 10

    Enter page reference string: 2 3 4 2 1 3 7 5 4 3

    2 -1 -1

    2 3 -1

    234

    234

    134

    134

    734

    534

    534

    534

    IMPLEMENTATION OF LRU PAGE REPLACEMENT

    AIM:To write a c program to implement LRU page

    PROGRAM:

    #include<stdio.h>

    Main()

    Int q[20],p[50],c=0,c1,d,f,I,j,k=0,n,r,t,b[20],c2[20];

    Printf(“Enter no of pages:”);

    Scanf(“%d”,&n);

    Printf(“Enter the reference string:”);

    For(i=0;i<n;i++)
    Scanf(“%d”,&p[i]);

    Printf(“Enter no of frames:”);

    Scanf(“%d”,&f);

    Q[k]=p[k];

    Printf(“\n\t%d\n”,q[k]);

    C++;

    K++;

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

    C1=0;

    For(j=0;j<f;j++)

    If(p[i]!=q[j])

    C1++;

    If(c1==f)

    C++;

    If(k<f)

    Q[k]=p[i];

    K++;

    For(j=0;j<k;j++)

    Printf(“\t%d”,q[j]);

    Printf(“\n”);

    }
    Else

    For(r=0;r<f;r++)

    C2[r]=0;

    For(j=i-1;j<n;j--)

    If(q[r]!=p[j])

    C2[r]++;

    Else

    Break;

    For(r=0;r<f;r++)

    B[r]=c2[r];

    For(r=0;r<f;r++)

    For(j=r;j<f;j++)

    If(b[r]<b[j])

    T=b[r];

    B[r]=b[j];

    B[j]=t;

    }
    }

    For(r=0;r<f;r++)

    If(c2[r]==b[0])

    Q[r]=p[i];

    Printf(“\t%d”,q[r]);

    Printf(“\n”);

    Printf(“\nThe no of page faults is %d”,c);

    OUTPUT:

    Enter no of pages:10

    Enter the reference string:7 5 9 4 3 7 9 6 2 1

    Enter no of frames:3

    7 5

    7 5 9

    4 5 9

    4 3 9

    4 3 7

    9 3 7

    9 6 7
    9 6 2

    1 6 2

    The no of page faults is 10

    You might also like