When the entries in the segment tables of two different processes point to the same physical location                          

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?
• The segment of code in which the process may change common variables, update tables, write into files is known as                          
• A circuitry that processes that responds to and processes the basic instructions that are required to drive a computer system is
• When the data at a location in cache is different from the data located in the main memory, the cache is called                            
• Consider a computer with 8 Mbytes of main memory and a 128K cache. The cache block size is 4 K. It uses a direct mapping scheme for cache management. How many different main memory blocks can map onto a given physical cache block?
• 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?
• 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                          
• ‘m’ processes share ‘n’ resources of the same type. The maximum need of each process doesn’t exceed ‘n’ and the sum of all their maximum needs is always less than m+n. In this setup, deadlock                          
• The link between two processes P and Q to send and receive messages is called
• The two ways of aborting processes and eliminating deadlocks are