Chapter 6 Problems

FACTS
Given the following list of references
a) 1 2 3 2 3 4 5 6 4 7 8 4 7 5 2 1 3 4 5 6 3 4 5 6
b) 6 3 2 1 3 2 1 7 3 9 3 2 4 6 4 2 7 2
c) 8 3 4 5 7 2 3 4 5 6 7 2 1 2 3

PROBLEM 1
Suppose a system has 4 frames, apply the page replacement algorithms, i.e.,
Optimal, FIFO, LRU, Second chance, LFU, for the above reference lists

PROBLEM 2
Suppose a system has 5 frames, apply the page replacement algorithms, i.e.,
Optimal, FIFO, LRU, Second chance, LFU, for the above reference lists

PROBLEM 3
Suppose a system has 28 KB of RAM with the fame size of 2KB. Given the list of
process P1 (3KB), P2(12KB), P3 (4KB), P4(17KB). Calculate the number of frames
allocated for each process with proportional allocation method.

PROBLEM 5
Given the reference list:
a) 1 2 1 2 3 4 3 3 4 5 6 7 3 4 5 7 8 3 1 9 1 9 2 2 9 9 1 1 2 2 3 3 4 5 6 7 8 9
b) 4 5 4 4 5 6 7 8 9 8 7 2 3 4 5 9 8 9 8 1 2 3 1 2 3 1 2 3 4 5 5 6 6 6 7 8 8 9
Identify the working set of the above reference lists at 6 th, 10th, 12th, 15th, 25th, 29th
reference with the working-set window size of 5, 6, 10, 12
2