Aspire's Library
A Place for Latest Exam wise Questions, Videos, Previous Year Papers,
Study Stuff for MCA Examinations - NIMCET
Study Stuff for MCA Examinations - NIMCET
Previous Year Question (PYQs)
Consider that a process has been allocated $3$ frames and has a sequence of page referencing as $1,2,1,3,7,4,5,6,3,1$. What shall be the difference in page faults for the above string using the algorithms of LRU and optimal page replacement for referencing the string?
Solution
Given reference string is
$1,2,1,3,7,4,5,6,3,1$
Number of frames is
$3$
Using LRU page replacement, total page faults are
$9$
Using optimal page replacement, total page faults are
$7$
Therefore, required difference is
$9-7=2$
Online Test Series, Information About Examination,
Syllabus, Notification
and More.
View More
Online Test Series, Information About Examination,
Syllabus, Notification
and More.
View More
Ask Your Question or Put Your Review.
