38 Deadlock Detection Algorithm Work and Finish be vectors of length m and  n, respectively. Initialize Step 1: Work := Available  For i = 1,2,…,n, if Allocation(i) 0, then Finish[i] := false,  otherwise Finish[i] := true. Step 2: Find an index i such that both:  Finish[i] = false  Request (i) Work  If no such i exists, go to step 4. 
38 Deadlock Detection Algorithm  Step 1: Work and Finish be vectors of length m and n, respectively. Initialize  Work := Available  For i = 1,2,…,n, if Allocation(i) 0, then Finish[i] := false, otherwise Finish[i] := true.  Step 2: Find an index i such that both:  Finish[i] = false  Request (i) Work  If no such i exists, go to step 4.
dead%20lock.docx