GATE 2014 A system contains three programs and each  requires three tape units for its operation. The  minimum number of tape units Which the system  must have such that deadlocks never arise is _____________.

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