作者shinbinxp (加油)
看板Grad-ProbAsk
標題[問題] 94 中山 OS
時間Wed Mar 25 22:33:18 2009
Assume a page reference string for a process with m frames(初始為空).
The page reference string has length p with n distinct page numbers
occuring in it. For any page-replacement algorithm
(a)what is a lower bound in the number of page fault?
(b)what is an upper bound on the number of page fault?
我覺得第一小題是: n
第二小題是: p
請問有人附議嗎？
謝謝
大家一起討論討論^^
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 140.127.208.67
1F：推 s987692:我覺得是這樣~ 03/26 04:16
2F：推 obazun:課本習題 答案就是醬 ~ 03/26 13:09
3F：→ shinbinxp:thx^^ 03/26 18:11