OPERATING SYSTEMS Bankers Algorithm Safety algorithm

SLIDE 7.33:

OS Assignment-2A Chapter 7 - Banker's Algorithm - Safety algorithm - Solve the following questions using Banker's safety algorithm using the following system snapshot at time T0 (similar to slide 7.33) - Consider the following system snapshot at time T0: - Answer the following questions 1. What is the total number of instances of resource type C? 2. What is the number of allocated instances of resource type B ? 3. The need of process P2 is: write it in the [ abcc ] format. [ ] 4. The Need Matrix is: 5. Is the system in a safe state at time T0 ? True / False 6. The following sequence is a safe state P1,P2,P3,P4,P5 True / False 7. Apply the safety algorithm and check if the system is in a safe state? Show all your work here including giving at least one safe sequence if it is in a safe state. and max are still same, is the system in a safe state? Show all your work again here including giving at least one safe sequence if it is in a safe state. Example of Banker's Algorithm 5 processes P0 through P4 - Need [i,j]=Max[i,j] Allocation [i,j] 3 resource types: A (10 instances), B (5instances), and C (7 instances) Snapshot at time T0 : \begin{tabular}{|l|l|l} \hline A & B & C \\ \hline 10 & 5 & 7 \\ \hline \end{tabular} 10 The system is in a safe state since the sequence P1,P3,P4,P2,P0 satisfies safety criteria safe state safe state safe state