Question

Consider the following page reference string:
4, 6, 7, 8, 6, 7, 8, 4, 6, 4, 4, 7, 5, 8
Assuming demand paging with three frames, how many page faults would occur for the following replacement algorithms? illustrate your work.

i. FIFO replacement.
ii. LRU replacement.

Answer 1

Answer:

Consider the following page reference string:

4, 6, 7, 8, 6, 7, 8, 4, 6, 4, 4, 7, 5, 8

Assuming demand paging with three frames, how many page faults would occur for the following replacement algorithms? illustrate your work.

i. FIFO replacement.

ii. LRU replacement.

Answer 2

٧٧٧٧٠٩٨٠٩١١١٨١١٣٤٤٤٤ والله منمكةجحخنه٧٧٧٧٤٧