Situations where two or more processes are reading or writing some shared data and the final result depends on who runs precisely which are called

Related MCQs

• In UNIX process management, the user processes runs in
• A situation where two or more processes coordinate their activities based on a condition is referred as
• Shared sub-directories and files are example of
• In UNIX process management, the system process runs in
• In shared memory multi processor
• With round-robin CPU scheduling in a time shared system
• In memory management Free page list is: A- A list of page frames available for reading in pages. B- A list where replaced page is assigned without modification. C-A list where replaced page is assigned with modification.
• In semaphore when the order of processes that are waiting to be removed from the queue is first in first out (FIFO) then it is called
• Match the following pairs A. Logical address(1) An actual location in main memory B. Relative address (2) An address is expressed as a location relative to some known point. C. Physical address (3) A memory location independent of the current assignment of data to memory
• In the following processes: a = a + 1; b = 2 × b; b = b + 1; a = 2 × a;the output is.