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:

Related MCQs

• Let S and Q be two semaphores initialized to 1, where P0 and P1 processes the following statements wait(S);wait(Q); ---; signal(S);signal(Q) and wait(Q); wait(S);---;signal(Q);signal(S); respectively. The above situation depicts a                .
• takes the data in data to be packed and packs it into
• During the execution of the instructions, a copy of the instructions is placed in the            .
• code, resources or data in such a way that only one process has access to shared object at a time.
• Paths that have an unbounded number of allowed nonminimal hops from packet sources, this situation is referred to as                  .
• processes to solve the critical section problem.
• A system has 3 processes sharing 4 resources. If each process needs a maximum of 2 units, then                       
•                      is the ability of multiple processes to co-ordinate their activities by exchange of information.
• processes to solve the critical section problem.
• The                           operation similarly computes an element-wise reduction of vectors, but this time leaves the result scattered among the processes.