adplus-dvertising
frame-decoration

Question

_________ replacement allows a process to select a replacement frame from the set of all frames, even if the frame is currently allocated to some other process.

a.

Local

b.

Universal

c.

Global

d.

Public

Posted under Operating System

Answer: (c).Global

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. _________ replacement allows a process to select a replacement frame from the set of all frames, even if the frame is currently allocated to some other process.

Similar Questions

Discover Related MCQs

Q. _________ replacement allows each process to only select from its own set of allocated frames.

Q. One problem with the global replacement algorithm is that :

Q. ________ replacement generally results in greater system throughput.

Q. A process is thrashing if :

Q. Thrashing _______ the CPU utilization.

Q. A locality is :

Q. When a subroutine is called,

Q. A program is generally composed of several different localities, which _____ overlap.

Q. The accuracy of the working set depends on the selection of :

Q. If working set window is too small :

Q. If working set window is too large :

Q. If the sum of the working – set sizes increases, exceeding the total number of available frames :

Q. Which of the following is FALSE ?

Q. The following program:

main()
{
if(fork()>0)
sleep(100);
}

results in the creation of:

Q. The following C program executes :

main()
{
fork();fork();printf("yes");
}
prints yes:

Q. A virtual memory system uses First In First Out (FIFO) page replacement policy and allocates a fixed number of frames to a process. Consider the following statements :

P : Increasing the number of page frames allocated to a process sometimes increases the page fault rate
Q : Some programs do not exhibit locality of reference

Which of the following is TRUE?

Q. For 3 page frames, the following is the reference string :

7 0 1 2 0 3 0 4 2 3 0 3 2 1 2 0 1 7 0 1

How many page faults does the LRU page replacement algorithm produce ?

Q. Applying the LRU page replacement to the following reference string :

1 2 4 5 2 1 2 4

The main memory can accommodate 3 pages and it already has pages 1 and 2. Page 1 came in before page 2.
How many page faults will occur ?

Q. In the working set model, for :

2 6 1 5 7 7 7 7 5 1 6 2 3 4 1 2 3 4 4 4 3 4 3 4 4 4 1 3 2 3

if DELTA = 10, then the working set at time t1 (….7 5 1) is :

Q. Consider the following page reference string :

1 2 3 4 2 1 5 6 2 1 2 3 7 6 3 2 1 2 3 6

For LRU page replacement algorithm with 4 frames, the number of page faults is :