1. Exercise (11)

2. Exercise Assume that page size is 10.
Please provide the page reference stream for the following sequence of address requests: 9, 10, 23, 34, 25, 1, 56, 44, 29.

3. Exercise
Suppose R= 3, 2, 4, 3, 4, 2, 2, 3, 4, 5, 6, 7, 7, 6, 5, 4, 5, 6, 7, 2, 1 is a page reference stream. Given a page frame allocation of 3, and assuming the primary memory is initially unloaded, how many page faults will the given reference stream incur under:
Belady’s optimal algorithm
LRU
FIFO

4. Belady’s Algorithm 3 2 4 5 6 7 1 3 3 2 3 2 4 3 2 4 3 2 4 3 2 4 3 2 4 3 2 4 3 2 4

5. LRU 3 2 4 5 6 7 1 3 3 2 3 2 4 3 2 4 3 2 4 3 2 4 3 2 4 3 2 4 3 2 4

6. FIFO 3 2 4 5 6 7 1 3 3 2 3 2 4 3 2 4 3 2 4 3 2 4 3 2 4 3 2 4 3 2 4