Question

Consider the page reference string given below for a virtual memory system :
1 2 3 2 6 3 4 1 5 6 1 6 4 2
Show the page replacements which occur for the following algorithms:
a. FIFO with 3 page frames
b. FIFO with 4 page frames
c. LRU with 3 page frames
d. LRU with 4 page frames
Also show the number of page faults that occur with each policy. Does Belady's Anomaly
occur ? Indicate in your answers. Also compare the performance of the two policies in
each scenario.

Answer 1

Answer:

nfzgmxtiajgdgksrizlhxtosktzkgxtkztkssktsfkstjsjfsfj

Explanation:

cgoditsurstxkgfylfoyduraktdhchlcyditskgfhlfoyzgkcjldjfxkgxhfafjxvmcjlhdgkdkgjdgkzgkdkgdkgdgkzfkxlgdksykzktsk