Скачать или смотреть Operating System (CS604) Fall 2022 Assignment # 02 solution

Draw the Resource Allocation Graph from given process states information of a system and identify the processes if any cycle is created in the graph.

P = P1, P2, P3, P4, P5
R = R1, R2, R3
E = { P1 → R1, P1 → R2, P2 → R1, P3 → R3, P4→R3, P5→ R3, R1 → P4, R2 → P2,
R2 → P5, R3→P2 }

Resource Instances
• One instance of resource type R1
• Two instances of resource type R2
• One instance of resource type R3

Suppose a system has resource type A with 18 instances and 5 processes and the current system state is shown in the following table.

Process Max Need Allocated
P0 12 5
P1 6 4
P2 14 4
P3 16 3
P4 8 2

Calculate the Need of each resource by using the need formula and draw the Need Matrix.

Assume a Logical Address Space of 64 pages of 1024 words, each mapped into a physical
memory of 32 frames. How you can calculate the various parameters related to paging.

No. of bits needed for p = ?
No. of bits neede for f = ?
No. of bits needed for d =?
Logical address size (bits) = ?
Physical address size (bits) = ?


#cs604
#solution
#assignment2
#2023

l will send solution at last day but if anyone need it before last day when send me your email address.