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?

Related MCQs

• 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                          
• 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 multiple threads are concurrently searching through a database and one thread returns the result then the remaining threads must be                          
• Instead of starting a new thread for every task to execute concurrently, the task can be passed to a                        
• A circuitry that processes that responds to and processes the basic instructions that are required to drive a computer system is
• ‘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                          
• When the entries in the segment tables of two different processes point to the same physical location                          
• The systems which allow only one process execution at a time, are called                      
• The systems which allows only one process execution at a time, are called
• If the size of logical address space is 2 to the power of m, and a page size is 2 to the power of n addressing units, then the high order            bits of a logical address designate the page number, and the          low order bits designate the page offset.