Swap space exists in                          

Related MCQs

• The                    time in a swap out of a running process and swap in of a new process into the memory is very high.
• Swap space is allocated                          
• Bounded waiting implies that there exists a bound on the number of times a process is allowed to enter its critical section
• A system is in a safe state only if there exists a                          
• If no cycle exists in the resource allocation graph                          
• The memory which allocates space for DOS and application is called
• If execution time binding is being used, then a process              be swapped to a different memory space.
• 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.
• An              uniquely identifies processes and is used to provide address space protection for that process.
• When there is a large logical address space, the best way of paging would be