COMPUTER SCIENCE AND ENGINEERING
ALGORITHMS
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
short term
|
|
|
medium term
|
|
|
long term
|
|
|
none
|
Detailed explanation-1: -Explanation: A medium-term scheduler selects which process to remove from memory by swapping. The medium-term scheduler swapped out the process and later swapped in. Swapping helps to free up memory.
Detailed explanation-2: -If a higher priority process arrives and wants service, the memory manager can swap out the lower priority process to execute the higher priority process. When the higher priority process finishes, the lower priority process is swapped back in and continues execution.
Detailed explanation-3: -Medium-term scheduling is a part of swapping. It removes the processes from the memory. It reduces the degree of multiprogramming. The medium-term scheduler is in-charge of handling the swapped out-processes. A running process may become suspended if it makes an I/O request.
Detailed explanation-4: -Swapping is basically implemented by Medium term scheduler. Medium term scheduler removes process from CPU for duration and reduce the degree of multiprogramming. And after some time these process can again be reintroduced into main memory. Process execution will again be resumed from the point it left CPU.
Detailed explanation-5: -Explanation: Swapping is also known as a technique for memory compaction.