In the context of memory management, what are placement and
replacement algorithms?
- 1 Answers
- 10159 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 tras timing?
Can you have 2 operating systems on one computer?
Explain time-stamping?
When does page fault error occur?
What is the safest operating system?
What is difference between program and x86?
How do I clean up program files?
Hi All, Can any one post a MS-DOS command/ utility tool, that modifies large size(nGBs) log file into MBs form the begining of log file? I will appreciate if any one give correct answer to this question. Thanks
What is the difference between mailbox and queue?
Do you know what is a binary semaphore? What is its use?
How do I remove prime os from my pc?
What is operating system in english?
Which program files folder is 64 bit?
What factors determine whether a detection-algorithm must be utilized in a deadlock avoidance system?
Explain demand paging, page fault interrupt, and trashing?
