Back to the 2024 paper
Similar questions
Operating SystemJustify the following statement: "Cycle in resource allocation graph does not always imply the occurrence of deadlock".20234mOPERATING SYSTEMDescribe the techniques for recovery from deadlock? Explain briefly resource allocation graph with examples.20247mOPERATING SYSTEMIf the wait for graph contains a cycle, then (i) a deadlock does not exist (ii) a deadlock exists (iii) the system is in a safe state (iv) either deadlock exists or system is in a safe state20222mOperating SystemWrite necessary conditions that must hold simultaneously to arise deadlock situation. Briefly explain different deadlock handling mechanisms.20227m
PreviousWhat is the difference between fixed partition and variable partition also explains the need of compaction.NextConsider a system with five processes P0 through P4 and four resources type A, B, C and D. Using the Banker's algorithm answer that the system is in a safe state? | | Allocation | Max | Available | | :--- | :--- | :--- | :--- | | | A B C D | A B C D | A B C D | | P0 | 0 0 1 2 | 0 0 1 2 | 1 5 2 0 | | P1 | 1 0 0 0 | 1 7 5 0 | | | P2 | 1 3 5 4 | 2 3 5 6 | | | P3 | 0 6 3 2 | 0 6 5 2 | | | P4 | 0 0 1 4 | 0 6 5 6 | |