2. Assume a page reference string for a prucess with m framcs (initially all emply). The page reference string has length n with p distinct page numbers occurring in it. For any page-replacemnent algorithms.
申論題內容
(a) What is an upper bound on the number of pige faults?
阿摩線上測驗
登入