In the context of memory management, what are placement and
replacement algorithms?
- 1 Answers
- 9712 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 significance of semaphores? What are the different types of semaphores?
How can the FCFS scheduling be made better?
What is the real-time system?
Write a function that responds to a click anywhere on the page by displaying an alert dialog. Display the event name if the user held Shift during the mouse click. Display the element name that triggered the event if the user held Ctrl during the mouse click.
What is the operating system?
How to take backup using active directory recyclebin concept
What is a flash memory?
What are the necessary conditions for deadlock to occur?
What is the trtw/trwt timing?
Given a Pid, how will you distinguish whether it is a process or a thread?
What are the 7 c's of communication?
To ensure one program doesnt corrupt other program in a Multi program enviornment what you should do?
Explain the resident set and working set of a process?
How the Kernel handles both the page stealer and the fault handler?
Why is round robin algorithm considered better than first come first served algorithm?
