PyQdeck LogoPyQdeckSubjects
Back to the 2023 paper

Module 4: Deadlocks

20232m

A computer system has 6 tape drives, with n processes competing for them. Each process may need 2 tape drives. The maximum value of n for which the system is guaranteed to be deadlock free is
(i) 6
(ii) 5
(iii) 4
(iv) 3

Search GoogleAsk AI

Similar questions

OPERATING SYSTEMA computer system has 9 tape drives, with 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 (i) 9 (ii) 7 (iii) 4 (iv) 620232mOPERATING SYSTEMA system contains six units of resource, and n processes that use the resource. What is the maximum value of n for which the system will be deadlock free if the maximum requirement of each process is 3?20197mOperating SystemDefine deadlock. List four necessary conditions for occurrence of deadlock. A system contains six units of resource, and *n* processes that use the resource. What is the maximum value of *n* for which the system will be deadlock free if the maximum requirement of each process is 3?201914mOperating SystemWith a single resource, deadlock occurs (i) if there are more than two processes competing for that resource (ii) if there are only two processes competing for that resource (iii) if there is a single process competing for that resource (iv) none of these20232m
PreviousThe technique of gradually increasing the priority of a process that wait in a system for a long time is known as? (i) blocking (ii) ageing (iii) starvation (iv) convoy effectNextWrite a program using "fork" to demonstrate the parent-child relationship of processes.