The correct answer is D. Demand paging.
Demand paging is a memory management technique in which a page is brought into memory only when it is needed. This is in contrast to contiguous memory allocation, in which all pages are loaded into memory at program startup. Demand paging can improve performance by reducing the amount of memory that is wasted on pages that are not currently being used.
Deadlock is a situation in which two or more processes are waiting for each other to release a resource that they need. This can cause the system to become unresponsive.
Page fault is
an event that occurs when a process tries to access a page that is not currently in memory. The operating system must then bring the page into memory from disk, which can cause a delay.Dormant paging is a technique that is used to save memory by paging out pages that are not currently being used. This can be useful for systems that have a limited amount of memory.
Here is a diagram that illustrates how demand paging works:
[Diagram of demand paging]
The diagram shows a process with three pages, P1, P2, and P3. When the process is first started, only P1 is loaded into memory. When the process tries to access P2, a page fault occurs. The operating system then brings P2 into memory from disk and updates the page table to reflect the new location of P2 in memory. The process can then continue execution.
Demand paging can improve performance by reducing the amount of memory that is wasted on pages that are not currently being used. However, it can also cause delays when a page fault occurs. The operating system must then bring the page into memory from disk, which can take some time.