CameraIcon

SearchIcon

MyQuestionIcon

2

You visited us 2 times! Enjoying our articles? Unlock Full Access!

Meaning of Elections

The optimal p...

Question

The optimal page replacement algorithm will select the page that

A

Has not been used for the longest time in the past

No worries! We‘ve got your back. Try BYJU‘S free classes today!

B

Will not be used for the longest time in the future

Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses

C

Has been used most number of times.

No worries! We‘ve got your back. Try BYJU‘S free classes today!

D

Has been used least number of times

No worries! We‘ve got your back. Try BYJU‘S free classes today!

Open in App

Solution

The correct option is B Will not be used for the longest time in the future
Optimal page replacement algorithm select a page that will not be used in the longest time in future.

Suggest Corrections

thumbs-up

0

Similar questions

Q. A process has been allocated 3 page frames. Assume that none of the pages of the process are avaialable in the memory initially. The process makes the following sequence of page reference(reference string) : 1, 2, 1, 3, 7, 4, 5, 6, 3, 1.

Least Recently Used (LRU) page replacement policy is a practical approximation to optimal page replacenent. For the above reference string, how many more page fautls occur with LRU than with the optimal page replacement policy?

Q. Recall that Belady's anomaly is that the page-fault rate may increase as the number of allocated frames increases. Now, consider the following statements:
S1: Random page replacement algorithm (where a page chosen at random is replaced) suffers from Belady's anomaly
S2: LRU page replacement algorithm suffers from Belady's anomaly
Which of the following is CORRECT?

Q. Consider the virtual page reference string 1, 2, 3, 2, 4, 1, 3, 2, 4, 1
on a demand paged virtual memory system running on computer system that has main memory size of 3 page frames which are initially empty. Let LRU, FIFO and OPTIMAL denote the number of page faults under the corresponding page replacement policy. Then

Q. Consider a virtual memory system with FIFO page replacement policy. For an arbitrary page access pattern, increasing the number of page frames in main memory will

Join BYJU'S Learning Program

similar_icon

Related Videos

lock

Meaning of Elections

SOCIAL SCIENCE

Watch in App

explore_more_icon

Explore more

Meaning of Elections

Standard IX Social Science

Join BYJU'S Learning Program

CrossIcon