سؤال : the page reference string for a process has length z with n distinct pages occurring in it . the process is run with m page frame which are initially empty .for any replacement policy : a- what is a lower bound on the number of page faults? b- what is a upper bound on the number of page faults?
جزاك الله خيراً ورزقكَ الفِردوس الأعلى
شكرا جزيلا
سؤال :
the page reference string for a process has length z with n distinct pages occurring in it . the process is run with m page frame which are initially empty .for any replacement policy :
a- what is a lower bound on the number of page faults?
b- what is a upper bound on the number of page faults?
الجواب لهذا السؤال والكثير من الاسئلة الاخرى موجود هنا
cseweb.ucsd.edu/classes/fa99/cse120/final-key.html
@@mustafasadiq هل يوجد اساله تانى زى الاساله دى محلوله
@@Workksa123 نعم يوجد الكثير في الانترنت. فقط ابحثي عنها في كوكل 😊