Scribd Logo
Upload

Welcome to Scribd!

  • 6 views

    Fifo Page Replacement

    Uploaded by

    UDAY BABU P
    The document describes a page reference string with 12 references and a memory with 3 frames. Using a FIFO page replacement algorithm, the number of page faults that would occur with this reference string and memory configuration is 9.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content

    You might also like

    Fifo Page Replacement

    Uploaded by

    UDAY BABU P
    6 views1 page
    The document describes a page reference string with 12 references and a memory with 3 frames. Using a FIFO page replacement algorithm, the number of page faults that would occur with this reference string and memory configuration is 9.

    Original Description:

    Original Title

    FIFO PAGE REPLACEMENT

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document describes a page reference string with 12 references and a memory with 3 frames. Using a FIFO page replacement algorithm, the number of page faults that would occur with this reference string and memory configuration is 9.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    6 views1 page

    Fifo Page Replacement

    Uploaded by

    UDAY BABU P
    The document describes a page reference string with 12 references and a memory with 3 frames. Using a FIFO page replacement algorithm, the number of page faults that would occur with this reference string and memory configuration is 9.

    Copyright:

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

    8. Consider the page reference string: 7, 4, 1, 6, 6, 1, 6, 3, 4, 6, 1, 5.

    Assume that the


    system has a memory with 3 frames. All frames are initially empty. How many page faults
    would occur if the system implements FIFO page replacement algorithm?

    Counting page faults - 1 Mark


    FIFO page replacement implementation - 2 Marks

    You might also like