GATE 2015 A system has 6 identical resources and N processes competing for them. Each process can request atmost 2 resources. Which one of the following values of N could lead to a deadlock? (a) 1 (b) 2 (c) 3 (d) 4 Download as PDF Related posts: GATE 2014 DEADLOCK BAKERS ALGO PYQ GATE 2017 Bankers algorithm Dead lock PYQ GATE CS 2020 CPU Scheduling PYQ GATE CPU scheduling PYQ GATE 1996 CPU Scheduling algo completion time RR GATE 2006 CPU scheduling PYQ GATE 2005 CPU scheduling PYQ GATE 2004 CPU scheduling PYQ GATE CPU scheduling PYQ GATE Bankers Algorithms OS#08 | Contiguous and linked list allocation for implementing file system in Hindi video | RGPV previous years
