Question:-
43. A computer system uses the Banker’s algorithm to deal with deadlocks its current state is shown in the table below, where P0, P1, P2 and P4 are processes and A, B, and C are resources types.





Maximum
 A B C
P0 6 5 4
P1 3 4 2
P2 1 0 4
P3 3 2 5






Allocated
 A B C
P0 0 3 4
P1 2 1 2
P2 0 02
P3 1 2 1



Available
A B C
4 3 1

Which of t he following is/are safe sequences?
P: P1, P0, P2, P3
Q: P1, P2, P0, P3
R: P1, P3, P0, P4
Option (A)
P and Q only
Option (B)
P and R only
Option(C)
Q and R only
Option(D)
All P, Q and R
Correct Option:
()
question-answer-faq-2442