Question # 4 Part a: Consider the following scenario and draw resource-allocation graph and the corresponding wait-for graph. Process waiting An instance of resource R1 is assigned to process Process...

subject: operating system

Extracted text: Question # 4 Part a: Consider the following scenario and draw resource-allocation graph and the corresponding wait-for graph. Process waiting An instance of resource R1 is assigned to process Process P1 is waiting for resource R2 Resource assigned P5 Another instance of resource R1 is assigned to Process P2 is waiting for resource R1 process P1 An instance of resource R2 is assigned to process Process P3 is waiting for resource R3 P4 An instance of resource R3 is assigned to process Process P3 is waiting for resource R2 P4 Another instance of resource R3 is assigned to Process P3 is waiting for resource R2 process P2 Process P4 is waiting for resource R1 Partb: (a) Using the concept of Shortest Remaining Time First algorithm, calculate Average tumaround time and Average waiting time. Process CPUBurst Time Arrival time PO 11 P1 4 P2 2 P3 12 3 Р4 18 (b) Calculate total logical and physical address space if logical address is 31 bits and physical address is 22 bits.