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 II₂. 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. 7 65 4 765 X 7 p. 2 of II₁ Loaded 125 6 x 6 p. 3 of II2 65 3 5 p. 6 of II₁ 95 4 4 4 p. 5 of II₁ 20 3 × 3 6 3 p. 5 of II₂ 55 2 7 2 2 p. 0 of II₂ 135 1 × 1 0 1 p. 0 of II₁ 110 0 1 0 2 0 p. 1 of II₂ 35 (a) Page table of II₁ (b) Page table of II₂ (c) RAM p. 1 p. 2 p. 4 p. 7 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, perform a page replacement beforehand. The FIFO algorithm is used for page replacement. Clearly mark all changes in all tables. Time 145: II2: LOAD 13000 Time 155: II2: LOAD 20800 Time 160: II₁: LOAD 10000 Time 165: II₁: LOAD 5011 Time 200: II2: LOAD 10030 Time 225: II2: LOAD 4120 Time 240: II₁: LOAD 20805 • Time 255: II₁: LOAD 675

Consider a memory of size 8KB (8192 bytes) that allows dynamic, variable sized partitioning among processes and uses a linked list to keep track of free spaces (hereafter referred to as the free list) in the memory at any given time. Assume that there are 6 processes and assume that their memory size requirements (in bytes) are as given below: Р1: 500, Р2: 600, Р3: 1300, Р4: 2000, Р5: 100, Р6: 200 Assume that the initial state of the free list is as shown below (BA is the base address and Sz is the size of each free space): ВА: 0; Sz: 1100 — ВА: 1200; Sz: 600 > BА: 2000; Sz: 1800> ВА: 6000%; Sz 400

How can I solve this problem? Detailed steps would be appreciated as I really want to learn how to do it

Consider a fixed partitioning scheme with equal-size partitions of 2¹6 bytes and a total main memory size of 224 bytes. A process table is maintained that includes a pointer to a partition for each resident process. How many bits are required for the pointer?