Users                that their processes are running on a paged system.

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?
• Memory protection in a paged environment is accomplished by                          
• In paged memory systems, if the page size is increased, then the internal fragmentation generally                          
• If the memory access time is denoted by ‘ma’ and ‘p’ is the probability of a page fault (0 <= p <= 1). Then the effective access time for a demand paged memory is
• Which facility dynamically adds probes to a running system, both in user processes and in the kernel?
• The operating system and the other processes are protected from being modified by an already running process because
• A circuitry that processes that responds to and processes the basic instructions that are required to drive a computer system is
• 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?
• If a process is executing in its critical section, then no other processes can be executing in their critical section. This condition 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