The following page-reference string:
1, 2, 4, 3, 2, 5, 4, 2, 4, 2, 1, 3, 2, 3, 1, 3, 6, 1, 6,
4.
Main memory with 3 frames of 1 kilobyte available and
they are all initially empty. Complete a figure, similar to Figure
8.14(in the slides or textbook), showing the frame allocation for
each of the following page replacement policies:
a. Optimal
b. Least recently used
c. First-in-first-out
Then, find the relative performance of each policy with
respect...