In …………........ page replacement algorithm, page that will not be used for longest period of time is replaced whenever a page fault occurs.
…………........ पेज रिप्लेसमेंट एल्गोरिथ्म में, जब भी पेज फॉल्ट होता है तो जो पेज लम्बे समय तक उपयोग में नहीं आयेगा उसे हटाया जाता है।
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: B. Optimal
Explanation
The optimal (Belady's) algorithm replaces the page that will not be used for the longest time in the future.
ऑप्टिमल (बेलाडी) एल्गोरिथ्म उस पेज को हटाता है जो भविष्य में सबसे लम्बे समय तक उपयोग नहीं होगा।
More Operating System & System Software questions
- In context of semaphores choose the option with valid codes for wait() and signal() functions :
- Calculate number of page faults for reference string 3, 2, 4, 1, 3, 5, 2, 1, 7, 3, 0 considering four frames and eight pages of equal size…
- Under personalization in windows we can create .......... to change desktop background, color, sound and screen saver all at once.
- In windows 8.1 which of the following options in control panel is related to adjustment of display brightness, volume and power options ?
- Terms NTFS and FAT 32 are closely related to which action on computer ?
- An integrated set of programs that controls the resources of computer system and provides its users an interface that is easy to use :