The Least Recently Used (LRU) policy

Related MCQs

• By principle of locality, in least recently used policy, in memory management
• In memory management : A- Fetch Policy B- Cleaning Policy C- Placement Policy: 1- It determines when a modified page should be written out to secondary memory. 2- It determines when a page should be bought into main memory. 3- It determines where in real memory a process piece is to be reside.
• Statement A : In memory management, the replacement policy deals with the selection of pages in memory to be replaced by arrived new page. Statement B: In memory management, the policy the fetch policy determines when a page should be bought into main memory.
• Statement A: The placement policy determines where in real memory a process piece is to reside. Statement B: The fetch policy determines when a page should be bought into main memory.
• A policy in memory management referred as clock policy because one can visualize the page frames as laid out in
• In memory management :A-Fixed allocation policy, B-Variable allocation policy: 1-It gives a process a fixed number of frames in main memory within which to execute. 2-It allows the number of page frames allocated to a process to be varied over the life time of the process. 3-In it a number of allocated frames are decided at initial load time.
• If normalized turnaround time of different process are given. Then Highest response ratio next policy in uni- processor scheduling policy selects.
• If normalized turnaround time of different process are given. Then Highest response ratio next policy in uni processor scheduling policy selects
• In First-In-First-out (FIFO) replacement policy used in memory management, the page frames to allocated to a process as circular buffer and
• In memory management when demand cleaning policy is applied