Answer:
a) 4 processes
b) 2 resources
c) R1: 2 instances
R2: 2 instances
d) R2
e) R1
f) R1
g) No resource
h) R1
i) R2
j) R2
k) No
l)No deadlock
Explanation:
You need to know that the resources that are required by the processes for completion are shown by the request edge and the resources allocated are shown by the allocation edge. And thus, we can find what resources are allocated to the process, and required for the completion accordingly. And here again, the cycle is created, and hence deadlock may or may not occur. However, we see that resources have multiple instances and get freed on time. And hence, deadlock does not occur.
Like,
P4 uses R2 and free one instance of R2.
P3 then uses one instance of R2 and free R2.
P3 then uses one instance of R3 and free R3.
P1 uses one instance of R1 and free R1 one instance
P1 then uses R2 and free R2.
P2 uses R1 and free R1.
Hence, all the processes are complete and deadlock does not occur.
Answer:
Sgromolo engages in data mirroring
Explanation:
The end goal of data mirroring is to increase data protection by providing shields to a computer system thereby preventing it from data loss and other possible losses due to data failures.
The technique used in data mirroring is that, it uses realtime protection of data by taking a data and replicating the exact copy without adding to or removing from it, to another storage location.
In this technique, Sgromolo picks up these data people think are n longer usable, and duplicated by being written to two or more identical hard drives, all of which are connected to one disk controller card.
Answer:
hawai
Explanation:
80x+90=170 x=1 hope this helps for any future reference plz mark brainliest:D
