Operating Systems Concepts Exam - Flashcards 1

Consider a system with 5 processes (P1 to P5) and 3 resource types (A, B, C). Given the following resource allocation state: Available: A(3), B(2), C(2); Allocation: P1(A:1, B:0, C:1), P2(A:2, B:0, C:0), P3(A:0, B:1, C:0), P4(A:0, B:0, C:1), P5(A:1, B:1, C:0); Max Need: P1(A:1, B:2, C:2), P2(A:3, B:2, C:1), P3(A:1, B:3, C:1), P4(A:1, B:1, C:2), P5(A:2, B:1, C:0). Using the Banker's Algorithm, determine if the system is in a safe state.

Describe how a 'wait-for' graph is used in deadlock detection when each resource has only one instance. How does a cycle in the graph indicate a deadlock?

Explain how the complexity of deadlock detection algorithms scales with the number of processes and resources in the system. Discuss the implications for large-scale systems.