Interested to Buy Any Domain ? << Click Here >> for more details...
In the context of memory management, what are placement and
replacement algorithms?
- 1 Answers
- 10448 Views
- I also Faced
- E-Mail Answers
Answer Posted / guest
Placement algorithms determine where in available real-
memory to load a program. Common methods are first-fit,
next-fit, best-fit. Replacement algorithms are used when
memory is full, and one process (or part of a process)
needs to be swapped out to accommodate a new program. The
replacement algorithm determines which are the partitions
to be swapped out.
| Is This Answer Correct ? | 28 Yes | 2 No |
Post New Answer View All Answers
How long should a chkdsk take?
How do I cancel chkdsk scan?
Is non-pre-emptive scheduling frequently used in a computer? Why?
What are loosely coupled systems?
Explain segmentation with paging?
What are overlays?
Tell something about deadlock and how can we prevent dead lock?
What is the real-time system?
What is trcd timing?
What do you understand by transaction atomicity?
what is the difference between mutexes and semaphores?
What is chkdsk command?
Page replacement algorithm in Operating System?
What do you know about interrupt?
Explain page cannibalizing?
