1. A virtual memory system is capable of storing four fra mes in memory at any one time. All four frames are initially empty.

Determine the n umber of page faults that would occur when the following page requests

4, 2, 0, 1, 7, 1, 0, 6, 1, 3, 0, 3, 6, 5, 4, 0, 7, 2 , 3, 4 are made and the page replacement algorithm is:

i. Least Recently Used.

ii. First-in First-out.

2. The figure below shows a virtual memory system with a virtual address space of 64K, a physical address space of 32K and a page size of 4K. Addresses are in base 10 form. Showing workings, state the:

i. number of entries in the page table.

ii. number of bits required to specify a location within a pa ge.

iii. number of bits required to specify a location in physi cal memory.

iv. physical address of virtual address 43320.

3. Derive the complete page table for the virtual memory sy stem of the figure below. The page table entries must be in binary. Assume th at the page entry is zero if the page frame is not mapped to a physical page