Resource sharing helps                        

Related MCQs

• The resource allocation graph is not applicable to a resource allocation system
• There are 10 different processes running on a workstation. Idle processes are waiting for an input event in the input queue. Busy processes are scheduled with the Round- Robin time sharing method. Which out of the following quantum times is the best value for small response times, if the processes have a short runtime, e.g. less than 10ms?
• A system has 3 processes sharing 4 resources. If each process needs a maximum of 2 units then, deadlock                          
• In a time-sharing operating system, when the time slot given to a process is completed, the process goes from the running state to the:
• Linux uses a time-sharing algorithm
• What is a reusable resource?
• If no cycle exists in the resource allocation graph                          
• If we preempt a resource from a process, the process cannot continue with its normal execution and it must be                          
• By operating system, the resource management can be done via
• The relocation register helps in