Recent questions tagged page-replacement

0 0 votes
1 1 answer
516
516 views
Consider a $\textsf{RISC}$ machine where page tables of the virtual memory system may be swapped to disk from memory and neither machine instructions nor page-table entri...
1 1 vote
0 0 answers
742
742 views
Consider the virtual page reference string$\text{1, 2, 3, 2, 4, 1, 3, 2, 4, 1}$On a demand paged virtual memory system running on a computer system that main memory size ...
27 27 votes
4 answers 4 answers
18.3k
18.3k views
Consider a demand paging system with four page frames (initially empty) and $\text{LRU}$ page replacement policy. For the following page reference string$$7, 2, 7, 3, 2, ...
0 0 votes
1 1 answer
441
441 views
Consider a system with page size $\text{p}$ and average process size $\text{m}$ and size of each page table entry is $\text{e}.$ What is the amount of space required by p...
0 0 votes
0 0 answers
377
377 views
Consider a system with three frames in memory and following memory references in the working set$$2 \quad1\quad 2\quad 3\quad 5\quad 4\quad 1\quad 3\quad 4\quad 2\quad 1$...
0 0 votes
1 1 answer
392
392 views
Which of the following Page Replacement Algorithm suffers from the Belady’s anomaly ?$\text{LRU}$Optimal page Replacement$\text{FIFO}$Both $\text{LRU}$ and $\text{FIFO}$
151 151 votes
10 answers 10 answers
58.7k
58.7k views
Consider a three-level page table to translate a $39-$bit virtual address to a physical address as shown below:The page size is $\text{4 KB} \;(1\text{KB}=2^{10}$ bytes$)...
38 38 votes
8 answers 8 answers
31.1k
31.1k views
In the context of operating systems, which of the following statements is/are correct with respect to paging?Paging helps solve the issue of external fragmentationPage si...
1 1 vote
2 2 answers
716
716 views
Which of the following Page Replacement Algorithm suffers from the belady’s anomaly?$LRU$Optimal Page Replacement$FIFO$Both $LRU$ and $FIFO$
1 1 vote
2 2 answers
2.9k
2.9k views
Consider a hypothetical machine with $3$ pages of physical memory, $5$ pages of virtual memory, and $<A, B, C, D, A, B, E, A, B, C, D, E, B, A, B>$ as the stream of page ...
1 1 vote
2 2 answers
3.4k
3.4k views
Non-contiguous memory allocation splits program into blocks of memory called ________ that can be loaded in non-adjacent holes in main memory.PagesFramesPartitionSegments