GATE | GATE-CS-2014-(Set-3) | Question 65

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 _________.
(A) 6
(B) 7
(C) 8
(D) 9

Answer: (B)
Explanation: If 6 resources are there then it may be possible that all three process have 2 resources and waiting for 1 more resource. Therefore, all of them will have to wait indefinitely. If 7 resources are there, then atleast one must have 3 resources so deadlock can never occur.
Quiz of this Question

Article Tags :

GATE

GATE-CS-2014-(Set-3)

GATE-GATE-CS-2014-(Set-3)

Recommended Articles

1. GATE | GATE-CS-2014-(Set-1) | Question 1

2. GATE | GATE-CS-2014-(Set-1) | Question 2

3. GATE | GATE-CS-2014-(Set-1) | Question 3

4. GATE | GATE-CS-2014-(Set-1) | Question 4

5. GATE | GATE-CS-2014-(Set-1) | Question 5

6. GATE | GATE-CS-2014-(Set-1) | Question 6

7. GATE | GATE-CS-2014-(Set-1) | Question 7

8. GATE | GATE-CS-2014-(Set-1) | Question 65

9. GATE | GATE-CS-2014-(Set-1) | Question 65

10. GATE | GATE-CS-2014-(Set-1) | Question 65

11. GATE | GATE-CS-2014-(Set-1) | Question 11

12. GATE | GATE-CS-2014-(Set-1) | Question 65

13. GATE | GATE-CS-2014-(Set-1) | Question 13

14. GATE | GATE-CS-2014-(Set-1) | Question 65

15. GATE | GATE-CS-2014-(Set-1) | Question 15

16. GATE | GATE-CS-2014-(Set-1) | Question 16

17. GATE | GATE-CS-2014-(Set-1) | Question 65

18. GATE | GATE-CS-2014-(Set-1) | Question 18

19. GATE | GATE-CS-2014-(Set-1) | Question 19

20. GATE | GATE-CS-2014-(Set-1) | Question 20

21. GATE | GATE-CS-2014-(Set-1) | Question 21

22. GATE | GATE-CS-2014-(Set-1) | Question 22

23. GATE | GATE-CS-2014-(Set-1) | Question 23

24. GATE | GATE-CS-2014-(Set-1) | Question 25

25. GATE | GATE-CS-2014-(Set-1) | Question 65