In the context of memory management, what are placement and
replacement algorithms?
Answer / 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 |
What is a 64 bit application?
What is the dispatcher?
Difference between Primary storage and secondary storage?
What is the highest priority software interrupt?
What is the code of mobile?
How to find the number of sockets created in your system?
What's the difference between semaphore , critical sections and mutex?
What are the basic functions of an operating system?
Give some benefits of multithreaded programming.
What is operating system in short answer?
abcD+abcd+aBCd+aBCD then the simplified function is ( Capital letters are copliments of corresponding letters A=compliment of a) [a] a [b] ab [c] abc [d] a(bc)* [e] mone (bc)*=compliment of bc
Explain what you mean by memory alignment.