A process has a memory reference pattern as follows:

2 3 1 3 1 2 4 3 2 1 3 2

The above pattern (which represents the virtual page numbers of the process) repeats

throughout the execution of the process. Assume that there are only 3 physical frames. Please fill up the following Table to

show the paging activity for a True LRU page replacement policy. Show an LRU

stack and the page that is replaced (if any) for the first 12 accesses. Clearly indicate

which accesses are hits and which are page faults.

H = Hit, PF= Page Fault, NA= Not Available (Do not fill up anything if it is NA)

2

3

1

3

1

2

4

3

2

1

3

2

Frame 1

Frame 2

Frame 3

LRU

NA

NA

NA

NA

NA

NA

NA

NA

NA

NA

NA

NA

Stack

Stack

Stack

H/PF