MCQ

a) False b) Truec c) None d) both a and b 4. A deadlock eventually cripples system throughput and will cause the CPU utilization to a) drop b) increase c) stay still d) none of the mentioned 5. A computer system has 16 tape drives, with x processes competing for them. Each process may need 4 tape drives. The maximum value of 'x for which the system is guaranteed to be deadlock free is: a) 2 b) 3 c) 4 d) 1 6. A system has 3 processes sharing 4 resources. If each process needs a maximum of 2 units then, deadlock: a) has to occur b) may occur c) can never occur d) none of the mentioned 7. If no cycle exists in the resource allocation graph a) then the system will not be in a safe state b) all of the mentioned c) then the system will be in a safe state d) none of the mentioned 8. Resource-allocation state is defined by the number of available and allocated resources, and the maximum demands of the processes a) True b) False c) none 9. Return to some safe state, restart process for that state is called. a) Rollback 10. A deadlock can be broken by a) preempt all resources from all processes b) abort all the process in the system c) abort one or more processes to break the circular wait d) none of the mentioned b) Cache C) ROM d) Starvation