retagged by
83 views
1 votes
1 votes
For a certain page trace starting with no page in the memory, a demand-paged memory system operated under the LRU replacement policy results in 9 and 11 page faults when the primary memory is of 6 and 4 pages, respectively. When the same page trace is operated under the optimal policy, the number of page faults may be:

(a) 9 and 7

(b) 7 and 9

(c) 10 and 12

(d) 6 and 7
retagged by

Please log in or register to answer this question.

Related questions

496
views
1 answers
3 votes
Sona Barman asked Jan 18, 2018
496 views
Self doubt:What is the rule or keyb point we should keep in mind while solving problems on LRU page replacement algorithm? Please explain with examples.
2.5k
views
1 answers
2 votes
jhaanuj2108 asked Aug 14, 2018
2,515 views
Consider a demand paged memory system, page table is held in registers. It takes 800 nsec to service a page fault if empty page is available or replaced page is not modif...
11.1k
views
4 answers
23 votes
admin asked Feb 15, 2023
11,117 views
Consider the following two-dimensional array $\text{D}$ in the $\text{C}$ programming language, which is stored in row-major order:int D[128][128];Demand paging is used f...
557
views
1 answers
2 votes
admin asked Dec 15, 2022
557 views
Compute the hit rate and miss/fault rate in least recently used page replacement algorithm for the given reference string with $4$ page frames. String: $7 \; 0 \; 1 \; 2 ...