49 votes 49 votes A system has $6$ identical resources and $N$ processes competing for them. Each process can request at most $2$ requests. Which one of the following values of $N$ could lead to a deadlock? $1$ $2$ $3$ $4$ Operating System gatecse-2015-set2 operating-system resource-allocation easy + – go_editor asked Feb 12, 2015 • edited Jun 23, 2018 by Pooja Khatri go_editor 34.4k views answer comment Share Follow See all 17 Comments See all 17 17 Comments reply Show 14 previous comments avazzz commented Jun 8, 2021 reply Follow Share Did gate gave bonus marks for this question? 1 votes 1 votes Ray Tomlinson commented Oct 25, 2023 reply Follow Share Important comments to understand this question https://gateoverflow.in/8114/gate-cse-2015-set-2-question-23?show=413769#a413769 0 votes 0 votes PreyumKr commented Dec 19, 2023 reply Follow Share They made wrong question. Even with 4 process it can never go in deadlock. All philosophy and whatnot but the question is wrong. Answer should be 6. 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes Nos of Resources=R=6 nos of processes=N Max demand=P=2 Now deadlock will not occur if R>=N*(P-1)+1 which gives N <=5, Now the max option given 4 which is taken as the solution. Hence the option D is correct. DIBAKAR MAJEE answered Apr 28, 2020 DIBAKAR MAJEE comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes I am mentioning few Relevent comments to understand this que from a lot of comments of this que. Answer is 4 But i didnt think same it should mark to alll Ray Tomlinson answered Oct 25, 2023 • edited Oct 26, 2023 by Ray Tomlinson Ray Tomlinson comment Share Follow See all 0 reply Please log in or register to add a comment.
