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
What problems are faced during the implementation of a network-transparent system?
Briefly explain thrashing.
How do you sleep in python?
What do you understand by system clock?
Explain about compiler and the functions executed by them?
Hello this is gaurav garg I have completed BCA. plz TEll me how will ask question in interview.
How do I unhide a file?
At what mode the fault handler executes?
What is the code of mobile?
How much ram do I need?
What is the cache memory?
What is the concept of reentrancy?
What is the concept of demand paging?
Which intel processor is 64 bit?
Which is better ext3 or ext4?