問題詳情
2. Assume a page reference string for a prucess with m framcs (initially all emply). Thepage reference string has length n with p distinct page numbers occurring in it. For any page-replacemnentalgorithms.
【題組】(a) What is an upper bound on the number of pige faults?
參考答案