Q. ________ replacement generally results in greater system throughput.

View solution

Q. A process is thrashing if :

View solution

Q. Thrashing _______ the CPU utilization.

View solution

Q. A locality is :

View solution

Q. When a subroutine is called,

View solution

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

View solution

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

View solution

Q. If working set window is too small :

View solution

Q. If working set window is too large :

View solution

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

View solution

Q. Which of the following is FALSE ?

View solution

Q. The following program:

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

results in the creation of:

View solution

Q. The following C program executes :

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

View solution

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?

View solution

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 ?

View solution

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 ?

View solution

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 :

View solution

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 :

View solution

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 FIFO page replacement algorithms with 3 frames, the number of page faults is :

View solution

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 FIFO page replacement algorithms with 4 frames, the number of page faults is :

View solution