单选题:consider a page-reference string for a process with m frames (in
consider a page-reference string for a process with m frames (initially all empty). The page-reference string has length p; n distinct page numbers occur in it. (Assume m < n )
The lower bound on the number of page faults is _____ . @[B](1)
A. m
B. n
C. p
D. n+m
E. n-m
F. n+m-p
A.m
B.n
C.p
D.n+m
E.n-m
F.n+m-p
答案:B
The lower bound on the number of page faults is _____ . @[B](1)
A. m
B. n
C. p
D. n+m
E. n-m
F. n+m-p
A.m
B.n
C.p
D.n+m
E.n-m
F.n+m-p
答案:B