Explain demand paging with a proper example

Computers and Technology

1 answer:

julia-pushkina [17]3 years ago

6 0

<h2>Demand paging :</h2>

<h3>In computer operating systems, demand paging (as opposed to anticipatory paging) is a method of virtual memory management. 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 and that page is not already in memory (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 are located in physical memory. This is an example of a lazy loading technique.</h3>

<h3 />

You might be interested in

Free coins who is octane and dont say u dont know because i will do the same to u

mart [117]

Answer:

Thank you for the free points.

8 0

3 years ago

Read 2 more answers

In a complex system, many subsystems interact with one another. How do these systems interact in terms of inputs and outputs?

Artemon [7]

Answer:

I think in there transmission you know inputs into ports like for their own

Explanation:

likeslike Spanish and is obviously inputs and outputs their portsinto the portsdifferent ports you know

4 0

3 years ago

Which programming language uses objects? O C++ O ALGOL O Pascal O BASIC

AfilCa [17]

Answer:

Both C++ and Pascal uses objects.

5 0

3 years ago

Read 2 more answers

The amount of money you can charge to a credit card is called

Novosadov [1.4K]

Transfer fee or just fee.

8 0

3 years ago

List the three control problems associated with competingprocesses and briefly define each.

hjlf

Answer and explanation :

the three control problems associated with competing process are

MUTUAL EXCLUSION : We know that some resources are shareable and some are not shareable. which means only one process can access the resource at a time this type of resources are called critical resources this code can be access at only one process at a time. the other process if required to access should not be allowed
DEADLOCK: this hold the process without complete for example suppose there are two resources R1 and R2 and two process P1 and P2 and P1 use R1 and P2 use R2 but after some time when P1 needs R2 but R2 is not available as it is used by P2 so the all process will be on hold
STARVATION : when priorities are given to the process as high priorities and low priorities. And high priorities process always competing then low priorities process have to wait for very long time this is called starvation

3 0

3 years ago