Register

UGC NET CSE | December 2007 | Part 2 | Question: 25

• edited by
839 views
0 votes
0 votes

The performance of a file system depends upon the cache hit rate. If it takes $1$ msec to satisfy a request from the cache but $10$ msec to satisfy a request if a disk read is needed, then the mean time (ms) required for a hit rate $’h’$ is given by :

  1. $1$
  2. $h+10(1-h)$
  3. $(1-h)+10h$
  4. $10$
• edited by
User Avatar

1 Answer

0 votes
0 votes
option B is correct.Since the hit ratio is h, so the miss ratio is (1- h) and time for cache access is 1 ms and that of hard disk is 10ms ,so the avaerage access time is give by = hit ratio* cache access time + (1-hit ratio)*disk access time =h*1+(1-h)*10=h+(1-h)10 which is the option B.
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
2 answers
1
go_editor asked Mar 28, 2020
407 views
UGC NET CSE | December 2007 | Part 2 | Question: 36
How many states can a process be in ? $2$ $3$ $4$ $5$
How many states can a process be in ?$2$$3$$4$$5$
User Avatar
0 votes
0 votes
2 answers
2
go_editor asked Mar 28, 2020
1,458 views
UGC NET CSE | December 2007 | Part 2 | Question: 37
A program has five virtual pages, numbered from $0$ to $4$. If the pages are referenced in the order $012301401234$, with three page frames, the total number of page faults with FIFO will be equal to : $0$ $4$ $6$ $9$
A program has five virtual pages, numbered from $0$ to $4$. If the pages are referenced in the order $012301401234$, with three page frames, the total number of page faul...
User Avatar
0 votes
0 votes
2 answers
3
go_editor asked Mar 28, 2020
493 views
UGC NET CSE | December 2007 | Part 2 | Question: 38
Average process size = $s$ bytes. Each page entry requires $e$ bytes. The optimum page size is given by : $\sqrt{(se)}$ $\sqrt{(2se)}$ $s$ $e$
Average process size = $s$ bytes. Each page entry requires $e$ bytes. The optimum page size is given by :$\sqrt{(se)}$$\sqrt{(2se)}$$s$$e$
User Avatar
0 votes
0 votes
2 answers
4
go_editor asked Mar 28, 2020
1,696 views
UGC NET CSE | December 2007 | Part 2 | Question: 40
The aging algorithm with a = $0.5$ is used to predict run times. The previous four runs from oldest to most recent are $40, 20, 20,$ and $15$ msec. The prediction for the next time will be : $15$ msec. $25$ msec. $39$ msec. $40$ msec.
The aging algorithm with a = $0.5$ is used to predict run times. The previous four runs from oldest to most recent are $40, 20, 20,$ and $15$ msec. The prediction for the...
User Avatar
Link Copied!