Scribd Logo
Upload

Welcome to Scribd!

  • OS EXPERIMENT 6 (A)

    Uploaded by

    Aditya Chandra
    13 views6 pages
    The document contains source code for implementing the FIFO page replacement algorithm. It takes the number of frames as input, then the reference string. It prints the reference string and frame numbers. For each reference, it checks if the page is in the frame list. If not, it's a page fault and the page is added to the frame list. If the list is full, the first page is replaced using FIFO. It prints the fault or hit and updates the frame list. Finally, it calculates and prints the total requests, faults and miss ratio.

    Original Description:

    operating system

    Original Title

    OS EXPERIMENT 6(a)

    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 contains source code for implementing the FIFO page replacement algorithm. It takes the number of frames as input, then the reference string. It prints the reference string and frame numbers. For each reference, it checks if the page is in the frame list. If not, it's a page fault and the page is added to the frame list. If the list is full, the first page is replaced using FIFO. It prints the fault or hit and updates the frame list. Finally, it calculates and prints the total requests, faults and miss ratio.

    Copyright:

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

    OS EXPERIMENT 6 (A)

    Uploaded by

    Aditya Chandra
    The document contains source code for implementing the FIFO page replacement algorithm. It takes the number of frames as input, then the reference string. It prints the reference string and frame numbers. For each reference, it checks if the page is in the frame list. If not, it's a page fault and the page is added to the frame list. If the list is full, the first page is replaced using FIFO. It prints the fault or hit and updates the frame list. Finally, it calculates and prints the total requests, faults and miss ratio.

    Copyright:

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

    ENROLLMENT NO.

    - 35196302718 NAME- ANANYA MAMGAIN


    ENROLLMENT NO.- 35196302718 NAME- ANANYA MAMGAIN
    ENROLLMENT NO.- 35196302718 NAME- ANANYA MAMGAIN
    ENROLLMENT NO.- 35196302718 NAME- ANANYA MAMGAIN
    Aim: Write a program to implement FIFO Page Replacement
    Algorithm.
    SOURCE CODE:
    print("Enter the number of frames: ",end="")
    capacity = int(input())
    f,fault,top,pf = [],0,0,'Hit'
    print("Enter the reference string: ",end="")
    s = list(map(int,input().strip().split()))
    print("\nString|Frame →\t",end='')
    for i in range(capacity):
    print(i,end=' ')
    print("Fault\n ↓\n")
    for i in s:
    if i not in f:
    if len(f)<capacity:
    f.append(i)
    else:
    f[top] = i
    top = (top+1)%capacity
    fault += 1
    pf = 'Miss'
    else:
    pf = 'Hit'
    print(" %d\t\t"%i,end='')
    for x in f:
    print(x,end=' ')
    for x in range(capacity-len(f)):
    print(' ',end=' ')

    ENROLLMENT NO.- 35196302718 NAME- ANANYA MAMGAIN


    print(" %s"%pf)
    print("\nTotal requests: %d\nTotal Page Faults: %d\nMiss Ratio:
    %0.2f%%"%(len(s),fault,(fault/len(s))*100))

    OUTPUT

    ENROLLMENT NO.- 35196302718 NAME- ANANYA MAMGAIN

    You might also like