A page daemon in an operating system will swap out memory even if some memory is still available. Will it do this when the amount of available memory is -- above (a), or below (b) -- the low watermark?

What do you call the piece of OS software that is run when it is discovered that a page of memory is on disk, and not in memory? a) the overlay, b) the background process, or c) the page-fault handler.

Swapping takes advantage of a present bit to decide whether a page is in memory or in the swap space on disk. Where is the present bit? a) in the page table, b) in the process control block, or c) in the translation lookaside buffer.

In an 80/20 workload, which of these page replacement policies tends to work the best: a) random, b) FIFO, or c) LRU ?

Using the LRU replacement policy, fill in the blanks in the table below. The cache size is 3.

access hit? evict resulting cache

0 no - 0

1 no - 0,1

1 yes - 0,1

2 no - 0,1,2

0 yes - 1,2,0

3 no 1 2,0,3

1 ____ ____ ____

0 ____ ____ ____

2 ____ ____ ____

Using the FIFO replacement policy, fill in the blanks in the table below. The cache size is 3.

access hit? evict resulting cache

0 no - 0

1 no - 0,1

1 yes - 0,1

2 no - 0,1,2

0 yes - 0,1,2

3 no 0 1,2,3

1 ____ ____ ____

0 ____ ____ ____

2 ____ ____ ____