The operating system and the other processes are protected from being modified by an already running process because

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?
• In a time-sharing operating system, when the time slot given to a process is completed, the process goes from the running state to the:
• Which facility dynamically adds probes to a running system, both in user processes and in the kernel?
• The portion of the process scheduler in an operating system that dispatches processes is concerned with                          
• Users                that their processes are running on a paged system.
• A circuitry that processes that responds to and processes the basic instructions that are required to drive a computer system is
• Which process can be affected by other processes executing in the system?
• A computer system has 6 tape drives, with ‘n’ processes competing for them. Each process may need 3 tape drives. The maximum value of ‘n’ for which the system is guaranteed to be deadlock free is?
• The                    time in a swap out of a running process and swap in of a new process into the memory is very high.
• If a process is executing in its critical section, then no other processes can be executing in their critical section. This condition is called?