Question

Answer the following question: Allocation Available A B C D 3 3 2 1 Ро P1 A B C D 2001 3121 2103 1312 1 432 Max ABCD 4212 5252 2316 1424 36 65 P2 P3 P4 The snapshot of a system 1) Illustrate that the system is in a safe state by demonstrating an order in which the processes may complete. (Format: use process number only, e.g. 01234) 2) If a request from process P1 arrives for (1,1,0,0), can the request be granted immediately? If yes show a safe sequence, otherwise write 'unsafe' 3) If a request from process P4 arrives for (0,0,2,0), can the request be granted immediately? If yes show a safe sequence, otherwise write 'unsafe'

Answer 1

Total resources - Allocation & Available. D 0 12 8 10 12 - Needed resources - Man-Allocation A - Po 2 2 2 1 3 P, 2 1 O P2 1 M a M PE 3 P4 2 2 we ] with available can satisfy Satisfy Po isto 3 ] 21 New available = ABCD 5 5 32 => 0 1 2 3 4 resources are more than requested itly 2 since available processes be granted. Seq. 1083 4. J since available resources it'll be granted, than requested segi 340123