Register

NIELIT 2016 MAR Scientist B - Section C: 39

• retagged by
592 views
0 votes
0 votes

Working set$(t,k)$ at an instant of time, $t$,is

  1. The set of $k$ future references that the operating system will make
  2. The set of future references that the operating system will make in the next $'k'$ time units
  3. The set of $k$ references with high frequency
  4. The set of pages that have been referenced in the last $k$ time units
• retagged by
User Avatar

1 Answer

1 votes
1 votes

Working set(set of pages referenced by the last t memory references , at time)

Working set(t,k)

 the working set at time k (with window t) is the set of pages referenced by the last t memory references ending at reference k

option D:.The set of pages that have been referenced in the last k time units

User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

2 votes
2 votes
2 answers
2
admin asked Mar 31, 2020
1,623 views
NIELIT 2016 MAR Scientist B - Section C: 8
When we move from the outermost track to the innermost track in a magnetic disk, then density(bits per linear inch) increases. decreases. remains the same. either remains constant or decreases.
When we move from the outermost track to the innermost track in a magnetic disk, then density(bits per linear inch) increases.decreases.remains the same.either remains co...
User Avatar
1 votes
1 votes
3 answers
3
admin asked Mar 31, 2020
948 views
NIELIT 2016 MAR Scientist B - Section C: 35
The file structure that redefines its first record at a base of zero uses the term relative organization. key fielding. dynamic reallocation. all of these.
The file structure that redefines its first record at a base of zero uses the termrelative organization.key fielding.dynamic reallocation.all of these.
User Avatar
0 votes
0 votes
0 answers
4
admin asked Mar 31, 2020
1,035 views
NIELIT 2016 MAR Scientist B - Section C: 36
What is the elapsed time of $P$ if records of $F$ are organized using a blocking factor of $2$(i.e. each block on $D$ contains two records of $F$) and $P$ uses one buffer? $12$ sec. $14$ sec. $17$ sec. $21$ sec.
What is the elapsed time of $P$ if records of $F$ are organized using a blocking factor of $2$(i.e. each block on $D$ contains two records of $F$) and $P$ uses one buffer...
User Avatar
Link Copied!