Answer.(c) 10.
Explanation.
Fifo page replacement algorithm. Queue is (4,3,2,1) so total page faults are 4 as queue was empty.
4 is there in queue. 3 is there in queue. 5 is inserted and 4 is removed so queue is (3215) page faults are 5.
3 is removed and 4 is inserted.queue is(2154) page faults are 6.
2 is removed and 3 is inserted,queue is (1543) page faults are 7.
1 is removed and 2 is inserted ,queue is (5432) page faults are 8.
5 is removed and 1 is inserted , queue is (4321) page faults are 9
4 is removed and 5 is inserted. Queue is (3215) page faults are 10.
No comments:
Post a Comment
Note: only a member of this blog may post a comment.