Interested to Buy Any Domain ? << Click Here >> for more details...
In the context of memory management, what are placement and
replacement algorithms?
- 1 Answers
- 10587 Views
- I also Faced
- E-Mail Answers
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 |
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
main() { charstr1="prakash"; charstr2="raju"; Str1=str2; printf("\n%d",str1); }
What is operating system and examples?
What is the Difference Between SystemCalls & Interpreter
What are the stipulations of C2 level security?
What are a virtual machines and site their advantages?
What are the basic functions of file management in os?
What does the safe mode do?
File which stores the DNS configuration at client side?
How can you pause the execution of a Thread for a certain amount of time?
Explain Scheduling?
What is gang scheduling in operating system (os)?
Windows 
