Computer Science - Operating Systems Concepts - Discussion
Discussion Forum : Operating Systems Concepts - Section 5 (Q.No. 28)
28.
Which policy replace a page if it is not in the favoured subset of a process's pages?
Discussion:
4 comments Page 1 of 1.
AmitR said:
9 years ago
The Working Set Page Replacement Algorithm. In the purest form of paging, processes are started up with none of their pages in memory. As soon as, the CPU tries to fetch the first instruction, it gets a page fault, causing the operating system to bring in the page containing the first instruction.
Shewangizaw Bogale said:
8 years ago
I think that the term : " is not in the favored subset " means the page is not recently used, so this shows that it is Least Recently Used (LRU).
The correct answer is : B.
The correct answer is : B.
Antoni Louro said:
3 years ago
The working set is the set of pages most likely to be accessed in a given time interval.
Ghazala Yasmin said:
1 decade ago
I don't understand, any one who explain me?
Post your comments here:
Quick links
Quantitative Aptitude
Verbal (English)
Reasoning
Programming
Interview
Placement Papers