4. Suppose we are using virtual memory. A process is made up of

6 pages (0 to 5) and is allowed to use 3 frames (0 to 2).

Suppose it wants to use its pages in this order:

0 4 1 0 3 2 1 2

(a) Using the First-in-First-Out algorithm, fill out this

chart to show which pages are in which frames at each point.

Also indicate whether a page fault occurred. When we start,

all frames are empty.

Page Used Frame 0 Frame 1 Frame 2 Page Fault?

0

4

1

0

3

2

1

2

(b) Now redo it with the Least-Recently-Used algorithm.

Page Used Frame 0 Frame 1 Frame 2 Page Fault?

0

4

1

0

3

2

1

2