Back to the 2019 paper
Similar questions
OPERATING 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 SYSTEMConsider a system consisting of four resources of the same type that are shared by three processes, each of which needs at most two resources. Show that the system is deadlock-free.20227mOPERATING 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 SYSTEMDefine deadlock. List four necessary conditions for occurrence of deadlock.20197m
PreviousHow many page faults would occur for the following reference string for four page frames and three page frames using LRU and FIFO algorithms: 1, 2, 3, 4, 5, 5, 3, 4, 1, 6, 7, 8, 7, 8, 9, 7, 8, 9, 5, 4, 5, 4, 2.NextExplain shortest-seek-time-first (SSTF) disk scheduling. Why SSTF scheduling tends to favour middle cylinders over the innermost and outer-most cylinders?