In the context of memory management, what are placement and
replacement algorithms?
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 to stop running thread?
What is the trtw/trwt timing?
How much ram do I need for excel?
What is chkdsk used for?
What is trp timing?
Does direct memory manipulation is an unsafe operations, if yes, how?
What does af_inet stand for?
What is best free operating system?
What is a full form of ok?
Can you tell what a device is by mac address?
What is a command interpreter?
Is x86 better than x64?
What is rdram?
Explain the concept of deadlocks? Why they are used?
What happens if you install 64 bit on 32?