In the context of memory management, what are placement and
replacement algorithms?
- 1 Answers
- 9705 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
Explain thread.
Is faster ram worth it?
What are the steps involved in following a particular instruction given by the cpu?
Define max, min heap and search time of heap.
Is safari the same as internet explorer?
What do you know about system model?
What is process communication?
Which one you will use to implement critical section?
Which is the best page replacement algorithm and Why? How
What are the five types of operating system?
what is difference between xp & 2003?
Explain what is meant by CORE DUMPS?
Explain the concept of the distributed systems?
What do you know about a pipe? When is it used?
Can you move programs from c drive to d?
