FIFO-Page-Replacement.c

#include <stdio.h>

void fifo(int[], int[], int, int);

int main()
{
    int i, pCount, fCount, pages[30], frames[20];
    printf("Number of Frames : ");
    scanf("%d", &fCount);
    // create frames array will null value
    for (i = 0; i < fCount; ++i) {
        frames[i] = -1;
    }
    printf("Number of Pages : ");
    scanf("%d", &pCount);
    printf("Enter the reference string\n");
    for (i = 0; i < pCount; ++i) {
        scanf("%d", &pages[i]);
    }
    // call the function
    fifo(pages, frames, pCount, fCount);

    return 0;
}

void fifo(int pages[], int frames[], int pCount, int fCount) {
    printf("\nRef.String   |\tFrames\n");
    printf("-------------------------------\n");
    int i, j, k, flag, faultCount = 0, queue = 0;
    for (i = 0; i < pCount; ++i) {
        printf("  %d\t|\t", pages[i]);
        flag = 0;
        for (j = 0; j < fCount; ++j) {
            if (frames[j] == pages[i]) {                // compare with string in str[]
                flag = 1;
                printf("   Hit");
                break;
            }
        }
        if (flag == 0) {                                // not present in frames
            frames[queue] = pages[i];
            faultCount++;
            queue = (queue + 1) % fCount;               // Queue position in circular way
            // display
            for (k = 0; k < fCount; ++k) {
                printf("%d  ", frames[k]);
            }
        }
        printf("\n\n");
    }
    printf("Total Page Faults = %d\n", faultCount);
}