In the context of memory management, what are placement and
replacement algorithms?
- 1 Answers
- 10133 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
What is dynamic scheduling in operating system (os)?
Define page fault interrupt?
How deadlock can be detected in a system?
What are ddks?
What is the largest ram?
What is the difference between micro kernel and macro kernel?
How do I stop blue screen?
When is a system in a safe state?
How much ram do I need?
WHATE IS DIFFERENT BETWEEN ANLOG , PLC & DCS OR EXPLAIN ANALOG / PLC / DCS SYSTEME
Which technology does Pentium use - RISC or CISC?
why is the context switch overhead of a user-level threading as compared to the overhead for processes? Explain.
Is sae same as af?
Draw the states of a process in an OS.
Differentiate between swapping and paging.
