Which is the best page replacement algorithm and Why? How
- 1 Answers
- 1052 Views
- I also Faced
- E-Mail Answers
Answer / Ashok Kumar Meeena
The Optimal Page Replacement (OPR) algorithm, given an understanding of future page references, offers the best performance in terms of minimum number of page faults. However, it's impractical to predict future page references accurately. The most commonly used approximation of OPR is the Least Recently Used (LRU) algorithm, which replaces the page that has been least recently accessed. The algorithm can be implemented using a variety of data structures like linked lists or hash maps.
| Is This Answer Correct ? | 0 Yes | 0 No |
What is short term scheduler in operating system (os)?
What are the pros and cons of using circuit switching?
Can ROM be used as stack?
What are short, longand mediumterm scheduling?
2 Answers Accenture, SwanSoft Technologies, TCS,
If there are too many page faults what is the problem?
unix system is a)multi processing b)multi processing ,multiuser c)multi processing ,multiuser,multitasking d)multiuser,multitasking
7 Answers eInfochips, Semantic Space, Verizon,
Explain latency, transfer and seek time with respect to disk i/o.?
What is an idle thread?
Differentiate between Multiprocessing, Mutliprogramming and Multithreading.
What does microprocessor speed depend on?
What are placement and replacement algorithms in the context of memory management?
Explain thrashing.
Windows 
