Page Replacement

Consider a demand paging system with three frames, and the following page reference string: 123454164513 2. The contents of the frames are as follows initially and after each refer...

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

Consider the following two-dimensional array D in the C programming language, which is stored in row-major order: int D[128] [128]; Demand paging is used for allocating memory and...

Consider a demand paging system with four page frames (initially empty) and LRU page replacement policy. For the following page reference string 7, 2, 7, 3, 2, 5, 3, 4, 6, 7, 7, 1,...

In which one of the following page replacement algorithms it is possible for the page fault rate to increase even when the number of allocated frames increases?

Consider a main memory with five page frames and the following sequence of page references: 3, 8, 2, 3, 9, 1, 6, 3, 8, 9, 3, 6, 2, 1, 3. Which one of the following is true with res...

A system uses $$3$$ page frames for storing process pages in main memory. It uses the Least Recently Used $$(LRU)$$ page replacement policy. Assume that all the page frames are ini...

Consider the virtual page reference string $$$1,2,3,2,4,1,3,2,4,1$$$ On a demand paged virtual memory system running on a computer system that has main memory size of $$3$$ page fr...

A system uses FIFO policy for page replacement. It has $$4$$ pages frames with no pages loaded to begin with. The system first accesses $$100$$ distinct pages in some order and the...

Consider the virtual page reference string $$$1,2,3,2,4,1,3,2,4,1$$$ On a demand paged virtual memory system running on a computer system that has main memory size of $$3$$ page fr...

In which one of the following page replacement policies, Belady’s anomaly may occur?

A process has been allocated $$3$$ page frames. Assume that none of the pages of the process are available in the memory initially. The process makes the following sequence of page...

The optimal page replacement algorithm will select the page that.

Consider a virtual memory system with $$FIFO$$ page replacement policy. For an arbitrary page access pattern, increasing the number of page frames in main memory will

A memory page containing a heavily used variable that was initialized very early and is in constant use is removed when

The following page addresses, in the given sequence, were generated by a program: 1 2 3 4 1 3 5 2 1 5 4 3 2 3 This program is run on a demand paged virtual memory system, with main...

Which page replacement policy sometimes leads to more page faults when size of memory is increased?

State whether the following statement TRUE or FALSE. The $$LRU$$ page-replacement policy may cause thrashing for some type of programs.