作者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