Q2: Consider the following page reference string 1, 2, 4, 2, 1, 4, 6, 7, 4, 7, 3, 1, 2, 5, 6, 7. Assume the replacement algorithm a- Consider FIFO replacement algorithm to find the number of page faults to transfer the above sequence of references when we start with an empty main memory with 4 page frames? b- Consider OPR replacement algorithm to find the number of page faults to transfer the above sequence of references when we start with an empty main memory with 4 page frames? c- Consider LRU replacement algorithm to find the number of page faults to transfer the above sequence of references when we start with an empty main memory with 4 page frames?

We have a system that uses virtual memory and a swap partition. The virtual address space consists of 8 pages, while the physical address space consists of 8 frames. The page size is 4 KiB = 4096 B. Currently, two processes are running: II₁ in П2. Below you can find page tables of both processes, the state of the main memory and the state of the swap partition. For each frame (physical memory), we know the loading time. Loaded 7 7 ☑ 7 p. 2 of II₂ 85 6 X 6 X 6 p. 1 of II₂ 60 5 1 52 5 p. 3 of II₁ 95 4321 X 4 4 p. 2 of II₁ 110 35 3 X 3 p. 0 of II₂ 40 2 4 27 2 p. 5 of II₂ 125 x 16 1 p. 5 of II₁ 120 00 03 0 p. 0 of II₁ 25 (a) Page table of II₁ (b) Page table of II2 (c) RAM p. 6 p. 3 p. 1 p. 6 of II of II of II of II₂ (d) Swap Figure 1: Current state of the system We are given a sequence of LOAD instructions of processes II₁ and II2. For each instruction, we also know the time when it is executed. Convert virtual addresses (argument of the LOAD instruction) to physical ones. If necessary,…

Consider the following virtual page reference string: 1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6. How many page faults would occur for the following replacement algorithms, assuming the physical memory has a total size of one, two, three, or four physical pages? Assume that all physical pages are initially empty (i.e., the system is newly started), so your fırst unique pages will all cost one fault each. • Strict LRU replacement (assuming all the timestamps in the history can be captured and stored precisely) • FIFO replacement Number of physical frames LRU FIFO 20 20 2 3 10 14 4.

Suppose we wish to sort the following values: 84, 22, 19, 11, 60, 68, 31, 29, 58, 23, 45, 93, 48, 31, 7. Assume that: we have three pages of memory for sorting; we will use an external sorting algorithm with a 2-way merge; a page only holds two values. We do not use double buffering and we use quick sort in pass 0 to produce the initial runs. For each sorting pass, show the contents of all temporary files except that you should fully utilize the buffers by sorting every 3 pages into a run in pass 0. Could you show step by step detailed explaination for this?