Consider the details of a paging system given below to answer the questions that follow. Page size 256 bytes.
Virtual memory address space of bytes.
Physical memory address space of bytes.
Operating system needs 510 bytes.
(a)Write memory access times needed to refer a frame.
(b)List frame numbers in the system.
(c)List page numbers in the system.
(d)Using the values in the paging system given above, explain the use of a page fault.
(e)Explain the use of hacking store using the answer given in part (d).
(f)If process A requests 1025 of memory, how many page table entries are needed in the page table?
(g)For a hexadecimal virtual address of 3184, what are the page number and the offset it is referring?
A system has four processes P1, P2 P3, P4 and three types of resources R1, R2, R3. The total resources in the system are (R1=3, R2=3, R3=2)
Process P1 holds an instance of R1 and requests an instance of R2.
Process P2 holds two instances of R2 and requests two instances of R1 and an instance of R3.
Process P3 holds an instance of R1 and requests an instance of R2.
Process P4 holds an instance of R3 and requests an instance of R1.
(a)What are the available resources?
(b)What is the status of P1?
(c)What is the status of P2?
(d)Explain the status of the system.
(e)Explain whether P4 can make an additional request for R3.