| 1. | With deadlock detection, requested resources are granted to |
|
Answer: (c).Processes
|
| 2. | A set of processes is deadlock if |
|
Answer: (a).each process is blocked and will remain so forever
|
| 3. | To avoid the race condition, the number of processes that may be simultaneously inside their critical section is |
|
Answer: (b).1
|
| 4. | With a single resource, deadlock occurs |
|
Answer: (d).none of these
|
| 5. | A state is safe if the system can allocate resources to each process (up to its maximum) in some order and still avoid deadlock. Then |
|
Answer: (d).all of these
|
| 6. | A computer system has 6 tape drives, with 'n' processes competing for them. Each process may need 3 tape drives. The maximum value of 'n' for which the system is guaranteed to be deadlock free is |
|
Answer: (c).2
|
| 7. | 'm' processes share 'n' resources of the same type. The maximum need of each process doesn't exceed 'n' and the sum all the their maximum needs is always less than m + n. In this set up |
|
Answer: (a).deadlock can never occur
|
| 8. | Consider a system having 'm' resources of the same type. These resources are shared by 3 processes A, B, C, which have peak time demands of 3, 4, 6 respectively. The minimum value of 'm' that ensures that deadlock will never occur is |
|
Answer: (a).11
|
| 9. | The methods for dealing with the deadlock problem is |
|
Answer: (d).all of these
|
| 10. | A system has 3 processes sharing 4 resources. If each process needs a maximum of 2 units, then |
|
Answer: (a).deadlock can never occur
|
