LRU page – replacement algorithm associates with each page the

Home / Engineering / Operating System (OS) / Question

M

Mr. Dubey • 51.43K Points
Coach

Q.) LRU page – replacement algorithm associates with each page the

(A) time it was brought into memory

(B) the time of that page’s last use

(C) page after and before it

(D) all of the mentioned

Correct answer : Option (B) - the time of that page’s last use

Share

Discusssion

Login to discuss.

Related MCQs on Operating System (OS)

Q. ISP exchanges internet traffic between their networks by

Q. Which of the following is essential concept related to Cloud?

Q. Management is not

Q. Voronoi diagram

Q. Triangle free graphs have the property of clique number is

Q. Observe the following management principles and pick the odd one out. Justify your answer.

Q. Total Quality Management (TQM) focuses on

Q. The surface area of a tape is the surface area of a disk.

Q. LZW would only send the _____to the dictionary

Q. If the longest chain in a partial order is of length l, then the partial order can be written as disjoint antichains.