A system with a First In First Out page replacement algorithm can store 3 pages in memory at any given time.

The diagram below illustrates the process, three time points have already been completed:

Complete the remaining pages with the incoming pages. Answer which pages are stored in the locations denoted "a?" and "b?". Write down your answer as a two digit response, e.g. if the pages were 8 and 9, write down 89 without spaces, commas or other symbols

(

Whilst

you are there, study other years. Is there a pattern on how things have

changed over the years? Are there any products that you expected to be

there but were not? Or the reverse?

A process that requires 3 MB of space is swapped to a hard disk. The  transfer rate to the disk is 139.5 MB/s and there is a further latency of 2.8 microseconds. Calculate the total Context Switch Swapping time (that is swap out and swap in) of this process. Write down your answer in milliseconds.

The following image contains a listing of a unix directory with one of the attributes enclosed in a red box. Select the correct attribute from the options below.

Identify the correct permissions that are granted with the following commands

Consider a

swapping system that has a series of holes (all in MB) with the following sizes (in order):

9, 20, 15, 22,  18,  17,  19,  31,  11, 14 

Three processes of sizes  9, 11, 13 MB arrive in order.  Select the correct order of the holes selected if a  worst fit strategy is used.