0 0 votes What is the total safe sequence possible? Operating System deadlock-prevention-avoidance-detection operating-system resource-allocation + – navaneethsaj 795 views answer comment Share Follow Print See all 5 Comments 5 5 Comments reply Show 2 previous comments Shaik Masthan commented Sep 13, 2024 reply Follow flag Total resources available before allocation is (10,10,10) Remaing resources available (10-6,10-6,10-5)=(4,4,5) So, you can't start with p2. If you starts with p1 or p3 or p5, then second one can't be p2. P2 should be after p4. With that observation, it make $\frac{5!}{2} = 60$ 1 1 replyShare navaneethsaj commented Sep 14, 2024 reply Follow flag Why not P2, P2 requires only less than available 1 1 replyShare Shaik Masthan commented Sep 14, 2024 reply Follow flag Yes, you are correct. I mis-read the table. The given table have maximum demand. But I thought it is remaining requirements. Then 5! is correct. 0 0 replyShare Please log in or register to add a comment.