Operating Systems · Question 18 · Easy
Operating Systems question 18
Which page-replacement algorithm gives the lowest possible number of page faults for any reference string, but cannot be implemented exactly in practice?
- FIFO
- Optimal (replace the page not needed for the longest time)
- LRU
- Second chance (clock)
Answer and explanation
Answer: B. Optimal (replace the page not needed for the longest time)
Explanation: The optimal algorithm needs to know future references, which the OS cannot know, so it serves as a benchmark for comparing practical algorithms.
Previous: Which of the following is NOT shared between threads of the same process? · Next: Belady's anomaly, where giving a process more page frames can increase its…
Practise operating systems
Try a fresh set of operating systems questions with an explanation after every answer, free and without signing up: Operating Systems practice. Or sit a full placement mock test.
More operating systems questions
- Two processes enforce mutual exclusion using only a shared variable turn…
- The Banker's algorithm is used for which deadlock-handling strategy?
- Which of the following is NOT shared between threads of the same process?
- Belady's anomaly, where giving a process more page frames can increase its…
- In UNIX and Linux, which system call creates a new process that is a copy of…
- A system has 3 page frames, all initially empty. For the page reference string…
- Process (arrival time, burst time) in ms: P1 (0, 7), P2 (2, 4), P3 (4, 1), P4…
- How many times is "A" printed when this C program runs? Assume every fork()…
- A disk has cylinders 0 to 199 and the head is at cylinder 50. The request…
- A system uses 32-bit logical addresses, a page size of 4 KB and 4-byte…
More technical & programming practice
Computer Networks · Software Engineering · Cloud & DevOps · GenAI Basics · Pseudo-code · C Programming · Java · Python
LogicWiz Exams home · All practice topics · Placement mock tests · Daily 10 challenge