Register

Recent questions tagged page-replacement

3 votes
1 answer
33
GATE Overflow Test Series | Operating Systems | Test 2 | Question: 6
For the following reference-modify ordered pair, match the following columns- ... $\text{I - Q, II - P, III - R, IV - S}$
For the following reference-modify ordered pair, match the following columns-$$\begin{array}{|ll|ll|}\hline\text{I.} & \text{(Reference bit = 0, Modify bit = 0)} & \quad ...
User Avatar
1 votes
2 answers
41
NIELIT 2017 DEC Scientific Assistant A - Section B: 17
Non-contiguous memory allocation splits program into blocks of memory called ________ that can be loaded in non-adjacent holes in main memory. Pages Frames Partition Segments
Non-contiguous memory allocation splits program into blocks of memory called ________ that can be loaded in non-adjacent holes in main memory.PagesFramesPartitionSegments...
User Avatar
0 votes
1 answer
44
NIELIT 2016 DEC Scientist B (CS) - Section B: 48
In which one of the following pages replacement policies, Belady's anomaly may occur? FIFO LRU Optimal MRU
In which one of the following pages replacement policies, Belady's anomaly may occur?FIFOLRUOptimalMRU
User Avatar
0 votes
2 answers
45
NIELIT 2017 DEC Scientist B - Section B: 51
The total number of page faults for the reference string $1,2,3,4,5,6,7,8,9,10$ using FIFO page replacement policy for a process, if $3$ frames are allocated to it are $9$ $10$ $8$ $11$
The total number of page faults for the reference string $1,2,3,4,5,6,7,8,9,10$ using FIFO page replacement policy for a process, if $3$ frames are allocated to it are$9$...
User Avatar
0 votes
1 answer
55
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 32 (Page No. 257)
In the $\text{WSClock}$ algorithm of Fig. $3-20(c),$ the hand points to a page with $R = 0.$ If $\tau = 400,$ will this page be removed? What about if $\tau = 1000?$
In the $\text{WSClock}$ algorithm of Fig. $3-20(c),$ the hand points to a page with $R = 0.$ If $\tau = 400,$ will this page be removed? What about if $\tau = 1000?$
User Avatar
0 votes
0 answers
58
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 29 (Page No. 257)
Consider the page sequence of Fig. $3-15(b)$. Suppose that the $R$ bits for the pages $B$ through $A$ are $11011011,$ respectively. Which page will second chance remove?
Consider the page sequence of Fig. $3-15(b)$. Suppose that the $R$ bits for the pages $B$ through $A$ are $11011011,$ respectively. Which page will second chance remove?
User Avatar
Page: