In case of simple paging all pages should be in main memory to run a process..while in case of virtual memory paging pages can be loaded as needed by the processor i.e. called demand paging...
its depends on number of processes in memory.
In demand paging, a page is not loaded into main memory until it is needed. In pure demand paging, even a single page is not loaded into memory initially. Hence pure demand paging causes a page fault. Page fault, the situation in which the page is not available whenever a processor needs to execute it.
This question cannot be answered simply; you will have to do an Internet Search to find articles that describe this process.
In computer operating systems, demand paging is an application of virtual memory. In a system that uses demand paging, the operating system copies a disk page into physical memory only if an attempt is made to access it (i.e., if a page fault occurs). It follows that a process begins execution with none of its pages in physical memory, and many page faults will occur until most of a process's working set of pages is located in physical memory. This is an example of lazy loading techniques.
Demand Paging
FALSE
Nope, swapping and paging are essentially synonymous. Excessive paging is known as thrashing.
C:\pagefile.dat
C:\pagefile.dat
C:/pagefile.sys
Segmented page allocation is a type of memory management that uses base and bound registers to determine memory faults, similar to dynamic page allocation. More importantly it is different to dynamic page allocation since the entire process doesn't have to be in memory, similar to using virtual memory paging where the program is broken into pieces. Unlike virtual memory paging, the maximum virtual memory size is limited to the size of physical memory.