Scribd Logo
Upload

Welcome to Scribd!

  • OSY pr15 Ashwin1)

    Uploaded by

    gmpawar003
    2 views2 pages
    This C code implements a basic page replacement algorithm to track page faults. It uses an array to represent the memory frames and iterates through a reference string to check if each page is already in memory. If not, it increments the page fault count and either adds the page if there is an empty frame or replaces the oldest frame using a FIFO policy. It prints the current frame contents and total page faults.

    Original Description:

    Original Title

    OSY pr15 Ashwin1]

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This C code implements a basic page replacement algorithm to track page faults. It uses an array to represent the memory frames and iterates through a reference string to check if each page is already in memory. If not, it increments the page fault count and either adds the page if there is an empty frame or replaces the oldest frame using a FIFO policy. It prints the current frame contents and total page faults.

    Copyright:

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

    OSY pr15 Ashwin1)

    Uploaded by

    gmpawar003
    This C code implements a basic page replacement algorithm to track page faults. It uses an array to represent the memory frames and iterates through a reference string to check if each page is already in memory. If not, it increments the page fault count and either adds the page if there is an empty frame or replaces the oldest frame using a FIFO policy. It prints the current frame contents and total page faults.

    Copyright:

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

    Operating System

    Name: Ashwin Pawar Roll no: 23


    Practical no: 15

    Practical code:

    #include <stdio.h>
    #define MAX_FRAMES 3
    int isPageInMemory(int page, int frames[], int frameCount) {
    for (int i = 0; i < frameCount; i++) {
    if (frames[i] == page) {
    return 1;
    }
    }
    return 0;
    }
    int main() {
    int referenceString[] = {1, 2, 3, ,2,1,5,2,1,6,2,5,6,3,1,3,6,1,2,4,3};
    int frameCount = 0;
    int frames[MAX_FRAMES];
    int pageFaults = 0;
    for (int i = 0; i < MAX_FRAMES; i++) {
    frames[i] = -1;
    }
    int referenceStringLength = sizeof(referenceString) / sizeof(referenceString[0]);
    for (int i = 0; i < referenceStringLength; i++) {
    int page = referenceString[i];
    if (!isPageInMemory(page, frames, frameCount)) {
    if (frameCount < MAX_FRAMES) {
    frames[frameCount] = page;
    frameCount++;
    } else {
    for (int j = 0; j < frameCount - 1; j++) {
    frames[j] = frames[j + 1];
    }
    frames[frameCount - 1] = page;
    }
    pageFaults++;
    }
    printf("Current Pages in Memory: ");
    for (int j = 0; j < frameCount; j++) {
    printf("%d ", frames[j]);
    }
    printf("\n");
    }
    printf("Total Page Faults: %d\n", pageFaults);
    return 0;}

    1
    Operating System

    OUTPUT:

    You might also like