Operating Systems Tutorial Cse

OPERATING SYSTEM TUTORIAL No. 2 1. 2. Consider a system with seven processes, A through G, and six resources (single instance), R through W. The state of which resources are currently owned and which ones are currently being requested is as follows: Process A holds R and requests S. Process B holds nothing but requests T. Process C holds nothing but requests S. Process D holds U and requests S and T. Process E holds T and requests V. Process F holds W and requests S. Process G holds V and requests U (i) Draw the resource allocation graph (ii) Is this system deadlocked, and if so, which processes are involved? 3. i. Use a resource allocation graph to derive a wait-for graph. ii. Does Deadlock exists? Justify your answer.4. 5. 6.