251 views

2 Answers

2 2 votes

$\mathbf{1}: [1, -, -]$ (FAULT)

$\mathbf{2}: [1, 2, -]$ (FAULT)

$\mathbf{1}: [2, 1, -]$ (HIT $- ~1$ moves to most recent)

$\mathbf{3}: [2, 1, 3]$ (FAULT)

$\mathbf{7}: [1, 3, 7]$ (FAULT $- ~2$ was LRU)

$\mathbf{4}: [3, 7, 4]$ (FAULT $- ~1$ was LRU)

$\mathbf{1}: [7,4,1]$ (FAULT $- ~3$ was LRU)

$\mathbf{2}: [4,1,2]$ (FAULT $- ~7$ was LRU)

$\mathbf{1}: [4,2,1]$ (HIT)

Total Faults$\mathbf{: 7}$

Answer:
Position:
Show:

Related questions

5 5 votes
1 1 answer
294
294 views
GO Classes asked Feb 21
294 views
Consider a disk with a sector size of $512$ bytes, $2000$ tracks per surface, $50$ sectors per track, and $5$ double-sided platters. A file of size $1 \mathrm{MB}(1 \math...
7 7 votes
3 3 answers
295
295 views
GO Classes asked Feb 21
295 views
Consider three processes $P_1, P_2$, and $P_3$ arriving at time $t=0$ with burst times $10,5 ,$ and $8$ respectively. The scheduler uses Preemptive Shortest Remaining Tim...
3 3 votes
2 2 answers
233
233 views
GO Classes asked Feb 21
233 views
In a system with $5$ processes and $12$ identical resources, each process requires a maximum of $3$ resources to complete its execution.What is the minimum number of reso...
3 3 votes
1 1 answer
218
218 views
GO Classes asked Feb 21
218 views
A counting semaphore $S$ is initialized to $10 $. The following operations are performed in order:$8 P(S)$ operations, followed by $3 V(S)$ operations, followed by $1 P(S...