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
Explain the refresh operation in a dynamic ram?
Where are chkdsk logs stored?
What is critical section problem?
How does reference counting manage memory allocated objects?
Different types of real-time scheduling?
What is 32 bit operating system?
What is long term scheduler in operating system (os)?
State the main difference between logical from physical address space.
What is a hard real time OS?
How much ram do I need 2019?
Explain trashing?
How long does chkdsk f'r take?
How much ram can 64 bit use?
Is 64bit faster than 32?
Do you know what is a binary semaphore?