Recent questions tagged page-replacement

A demand-paging system has $3$ physical page frames.Consider the reference string:$\text{A, B, C, D, B, A, B, A, D, C}$Starting with empty memory, determine the total num...

A virtual-memory system uses the LRU page-replacement algorithm.There are four physical page frames at hexadecimal addresses:$4000,\ 5000,\ 6000,\ 7000$The page-reference...

Which of the following statements about page-replacement policies are correct?LRU always produces fewer page faults than FIFO. OPT always performs at least as well as LRU...

In a virtual-memory system, the FIFO page-replacement algorithm is used.The virtual-page reference string is : $1,\ 4,\ 2,\ 4,\ 1,\ 3$There are $3$ page frames.After the ...

A process generates the following first $25$ page references:$A,\ B,\ C,\ D,\ E,\ B,\ D,\ B,\ C,\ D,\ B,\ C,\ D,\ B,\ C,\ B,\ D,\ E,\ B,\ D,\ E,\ B,\ C,\ B,\ A$There are ...

Assume the following page-reference stream:$A,\ B,\ C,\ D,\ A,\ B,\ E,\ A,\ B,\ C,\ D,\ E$Assuming a page cache of size $3$ pages and a FIFO replacement policy, how many ...

Consider the two-dimensional array A:int A[][] = new int[100][100];where A[0][0] is at location 200 in a paged memory system with pages of size 200. A small process that ...

Match List - I with List - II.$\begin{array}{|ll|ll|} \hline & \textbf{List - I} && \textbf{List-II} \\ & \textbf{(operating system concepts)} && \textbf{(characteristics...

Consider the following page address trace generated by a cache main memory scheme and has a cache capacity of four pages:1,6, 4,5, 1, 4, 3, 2, 1, 2, 1, 4, 6, 7, 4Assuming...

​Consider a demand paging system with three frames, and the following page reference string: 1 2 3 4 5 4 1 6 4 5 1 3 2 . The contents of the frames are as follows initial...

In optimal page replacement algorithm, information about all future page references is available to the operating system (OS). A modification of the optimal page replacem...