Question

Show how many page faults are will occur if a process access the following page sequence (reference string). Assume OS is using a fixed number of 4 pages allocated for the process and is using First-In-First-Out (FIFO) algorithm.

Count the faults acquired in the page table initialization.

Show your work by completing the following table:

Show how many page faults are will occur if a process access the following page sequence (reference string). Assume OS is using a fixed number of 4 pages allocated for the process and is using First-In-First-Out (FIFO) algorithm. Count the faults acquired in the page table initialization. Show your work by completing the following table: 3 6 0 6 2 4 5 9 8 0 6 8 8 6 6 1 6 2 0 3 3 6 1 |חד F

Answer 1

Solution:

FIFO uses the First In First Out procedure

that means firstly entered page will be replaced first if there is no space in the frames

we mark as page fault if the upcoming page does not exist in the frame we have to add it

we mark as page hit if the upcoming page exists in the frame we have to skip it

in this way the table is filled

Table:

3 LO 0 6 4 un 9 8 0 6 00 8 6 6 1 6 2. 0 1 3 3 3 3 2 3 6 4 4 O 0 0 0 0 0 0 0 6 6 6 Сл 0 5 9 6 6 6 6 6 6 6 6 0 6 0 0 0 0 9 6 9 8 9 9 9 9 1 1 1 2 2 2 8 8 8 8 8 8 N ICO 8 H 2 F IN IN F F H F F F F H H H F

Number of page faults occurred is 12

Any queries comment, please

if you like my work please upvote my answer

Thank you :)