1.
A process is thrashing if :
Answer: Option 'B'
it spends a lot of time paging, than executing
2.
Thrashing _______ the CPU utilization.
Answer: Option 'C'
decreases
3.
A locality is :
Answer: Option 'A'
a set of pages that are actively used together
4.
When a subroutine is called,
Answer: Option 'A'
it defines a new locality
5.
A program is generally composed of several different localities, which _____ overlap.
Answer: Option 'A'
may
6.
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 :
Answer: Option 'C'
{1, 6, 5, 7, 2}
7.
The accuracy of the working set depends on the selection of :
Answer: Option 'B'
working set size
8.
The accuracy of the working set depends on the selection of :
Answer: Option 'B'
working set size
9.
If working set window is too small :
Answer: Option 'A'
it will not encompass entire locality
10.
If working set window is too large :
Answer: Option 'B'
it may overlap several localities
11.
If the sum of the working – set sizes increases, exceeding the total number of available frames :
Answer: Option 'D'
the operating system selects a process to suspend
12.
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 :
Answer: Option 'A'
10
13.
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 5 frames, the number of page faults is :
Answer: Option 'C'
8
14.
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 Optimal page replacement algorithms with 3 frames, the number of page faults is :
Answer: Option 'D'
11
15.
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 :
Answer: Option 'C'
14
16.
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 :
Answer: Option 'A'
16