Interested to Buy Any Domain ? << Click Here >> for more details...
In the context of memory management, what are placement and
replacement algorithms?
- 1 Answers
- 10546 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 |
Why do we use semaphore?
How do you tell if your computer is 32 or 64 bit?
What is BSS(Block Started by Symbol)?
Some omeone on campus calls and says they have a new Mac. They've just pulled it out of the box and want to plug it into the campus network. What might they need to set to make this work?
What is a volatile keyword?
What are advantages of operating system?
Difference between time sharing and multitasking systems?
Is 32 bit obsolete?
How do I empty my mac cache?
Does a clean install erase everything?
Measurements of a certain system have shown that the average process runs for a time T before blocking on I/O. A process switch requires a time S, which is effectively wasted (overhead). The CPU’s efficiency is the fraction of its time its spends executing user programs, i.e., executing user processes. For round robin scheduling with quantum Q, give a formula for the CPU efficiency for each of the following: (a) Q = ∞ (b) Q > S + T (c) S <Q<S + T (d) Q = S
What is the difference between mailbox and queue?
Windows 
