Belady's anamoly says you can (slide 17, Lecture 8) the number of page faults is not always inversely proportional to the number of frames.

In this assignment you will experiment on this.

Your tasks are:

1. Generate a random reference string of length 30, (each number of the string is between 0 to 8).

2. You initialize the frame size as 1.

3. Run FIFO page replacement algorithm.

4. Count the page fault.

5. Increase frame size to 2 and repeat steps 3 and 4.

6. You will repeat step 5 until the frame size is 10.

7. Draw a graph and show the relationship between number of frames vs number of page fault (similar to the graph of slide 17, lecture 8)

8. Report this graph along with its explanation in a word/pdf file.

So finally you will be submitting your code and the report.

Attachment:- Memory.rar