This assignment is to be done individually, not in teams.

To do:

• Solve the following problems from the textbook:

• 9.5, 9.8, and 9.16 (pages 294-295)

 
• Consider the following page-reference string:

    read(c),write(a),read(d),write(b),read(e),read(b),write(a),read(b),read(c),read(d)

How many page faults would occur for the following replacement algorithms, FIFO, LRU, Second Chance and Enhanced Second Chance, assuming 4 page frames. Also, assume that pages a,b,c,d have initially been read. Indicate the pages that are brought into memory and those that are replaced.

Repeat this for the Working Set (WS) and Page Fault Frequency (PFF) replacement heuristics. Assume that pages e,d,a have initially been read, and that the system constant used to determine the set of pages previously referenced is 4 under WS and 2 under PFF.