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. This variant of swapping is sometimes called?

  1. Home

Question:
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. This variant of swapping is sometimes called?

1. priority swapping

2.pull out, push in

3.roll out, roll in

4. none of the mentioned

Posted Date:-2022-03-25 10:59:49

More MCQS Questions and answers

  1. A state is safe, if _______
  2. If execution time binding is being used, then a process ______ be swapped to a different memory space.
  3. If no cycle exists in the resource allocation graph ______
  4. If the resources are always preempted from the same process __________ can occur.
  5. The backing store is generally a ______
  6. The resource allocation graph is not applicable to a resource allocation system _____
  7. The two ways of aborting processes and eliminating deadlocks are ______
  8. A deadlock can be broken by ______
  9. A memory buffer used to accommodate a speed differential is called ______
  10. A system is in a safe state only if there exists a _____
  11. All unsafe states are _______
  12. Binding of instructions and data to memory addresses can be done at ______
  13. Cost factors for process termination include ______
  14. CPU fetches the instruction from memory according to the value of _______
  15. Each request requires that the system consider the _____________ to decide whether the current request can be satisfied or must wait to avoid a future possible deadlock.
  16. Given a priori information about the ________ number of resources of each type that maybe requested for each process, it is possible to construct an algorithm that ensures that the system will never enter a deadlock state.
  17. 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. This variant of swapping is sometimes called?
  18. If binding is done at assembly or load time, then the process _____ be moved to different locations after being swapped out and in again.
  19. If the process can be moved during its execution from one memory segment to another, then binding must be _______
  20. If we preempt a resource from a process, the process cannot continue with its normal execution and it must be _______
  21. In a system that does not support swapping _______
  22. Memory management technique in which system stores and retrieves data from secondary storage for use in main memory is called?
  23. ne way to ensure that the circular wait condition never holds is to ______
  24. Run time mapping from virtual to physical address is done by _____
  25. Swap space is allocated ______
  26. Swapping requires a ________
  27. The ________ consists of all processes whose memory images are in the backing store or in memory and are ready to run.
  28. The _________ time in a swap out of a running process and swap in of a new process into the memory is very high.
  29. The ___________ must design and program the overlay structure.
  30. The ___________ swaps processes in and out of the memory.
  31. The address generated by the CPU is referred to as _______
  32. The address loaded into the memory address register of the memory is referred to as _____
  33. The Banker’s algorithm is ________ than the resource allocation graph algorithm.
  34. The base register is also known as the _______
  35. The content of the matrix Need is _______
  36. The data structures available in the Banker’s algorithm are _____
  37. The idea of overlays is to _______
  38. The major part of swap time is _______ time.
  39. The process to be aborted is chosen on the basis of the following factors?
  40. The run time mapping from virtual to physical addresses is done by a hardware device called the _____
  41. The size of a process is limited to the size of ______
  42. Those processes should be aborted on occurrence of a deadlock, the termination of which?
  43. To _______ to a safe state, the system needs to keep more information about the states of processes.
  44. To ensure no preemption, if a process is holding some resources and requests another resource that cannot be immediately allocated to it _______
  45. What is Address Binding?
  46. What is Dynamic loading?
  47. What is the advantage of dynamic loading?
  48. What is the solution to starvation?
  49. Which of the following is TRUE?
  50. Which one of the following is the address generated by CPU?
Search
R4R Team
R4Rin Top Tutorials are Core Java,Hibernate ,Spring,Sturts.The content on R4R.in website is done by expert team not only with the help of books but along with the strong professional knowledge in all context like coding,designing, marketing,etc!