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

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

As we learned in the lecture, the memory is divided into different locations in a hierarchy, with some locations holding more memory than others. Below are several options that indicate some options in growing order. Select the option that is NOT CORRECT.

Memory can be organised in many different ways, with the length of the word / cell / bit width determining how bits are grouped.

Match the diagrams with the number of bits they contain

Consider a

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

10,  4,  10,  18,  7,  9,  12,  15 

Three processes of sizes  5, 6, 11 MB arrive in order.  Select the correct order of the holes selected if a  best fit strategy is used.

Consider a

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

20, 15, 22,  18,  17,  29,  21,  11, 14 

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

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

A LINUX program uses POSIX-compliant API methods (i.e. pthread_create, pthread_join, etc.) to create and synchronise 9 threads. How many PCBs does the OS need, to manage these threads' executions?