Back to the 2023 paper
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 SystemIf a process has 24 k bytes logical address space and the page size is 4096 bytes then the number of frames of that process is? (i) 12 (ii) 6 (iii) 8 (iv) 1620232mOperating 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?201914m
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.
Free AppAndroid App
Coursify Android App
Generate AI courses, take quick quizzes between classes, and master complex engineering concepts on the go.