The two ways of aborting processes and eliminating deadlocks are                          

Related MCQs

• 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?
• If deadlocks occur frequently, the detection algorithm must be invoked                  
• A circuitry that processes that responds to and processes the basic instructions that are required to drive a computer system is
• The link between two processes P and Q to send and receive messages is called
• When the entries in the segment tables of two different processes point to the same physical location                          
• The three ways in which a process responds to a signal are                          
• A situation where several processes access and manipulate the same data concurrently and the outcome of the execution depends on the particular order in which access takes place is called                          
• Which facility dynamically adds probes to a running system, both in user processes and in the kernel?
• If all processes I/O bound, the ready queue will almost always be              and the Short term Scheduler will have a              to do.
• When several processes access the same data concurrently and the outcome of the execution depends on the particular order in which the access takes place, is called?