8,846 views
2 votes
2 votes

Consider the following page trace:

4,3,2,1,4,3,5,4,3,2,1,5

Percentage of page fault that would occur if FIFO page replacement algorithm is used with number of frames for the JOB m=4 will be

  1. 8
  2. 9
  3. 10
  4. 12

2 Answers

2 votes
2 votes

4 frames

      1 1 1 1 1 1 2 2 2
    2 2 2 2 2 2 3 3 3 3
  3 3 3 3 3 3 4 4 4 4 5
4 4 4 4 4 4 5 5 5 5 1 1
PF PF PF PF -- -- PF PF PF PF PF PF

page faults=10

Answer:

Related questions

4 votes
4 votes
3 answers
1
go_editor asked Jul 5, 2016
3,855 views
Resources are allocated to the process on non-sharable basis ismutual exclusionhold and waitno pre-emptioncircular wait
4 votes
4 votes
4 answers
2
go_editor asked Jul 5, 2016
8,260 views
Pre-emptive scheduling is the strategy of temporarily suspending a running processbefore the CPU time slice expiresto allow starving processes to runwhen it requires I/Ot...
1 votes
1 votes
1 answer
3
go_editor asked Jul 4, 2016
2,811 views
Which command is the fastest among the following?COPY TO <NEW FILE>COPY STRUCTURE TO <NEW FILE>COPY FILE <FILE 1 <FILE 2>COPY TO MFILE-DAT DELIMITED
6 votes
6 votes
4 answers
4
anitha asked May 25, 2016
9,774 views
In round robin CPU scheduling as time quantum is increased the average turn around timeincreasesdecreasesremains constantvaries irregularly