Est. Budget: $10.00
#### Consider the following sequence of virtual memory references (in decimal) generated by a single program in a pure paging system:
100, 110, 1400, 1700, 703, 3090, 1850, 2405, 2460, 4304, 4580, 3640
a. Derive the corresponding reference string of pages (i.e. the pages the virtual addresses are located
on), assuming a page size of 1024 bytes
b. Determine the number of page faults for each of the following page replacement strategies,
assuming that two (2) page frames are available ...