Memory Management Swapping Processes 1 - Operating System Questions and Answers

  • 1. Address Binding is :
   A.) going to an address in memory
   B.) locating an address with the help of another address
   C.) binding two addresses together to form a new address in a different memory space
   D.) a mapping from one address space to another

Answer: Option 'D'

a mapping from one address space to another

  • 2. Binding of instructions and data to memory addresses can be done at :
   A.) Compile time
   B.) Load time
   C.) Execution time
   D.) All of the mentioned

Answer: Option 'D'

All of the mentioned

  • 3. If the process can be moved during its execution from one memory segment to another, then binding must be :
   A.) delayed until run time
   B.) preponed to compile time
   C.) preponed to load time
   D.) none of the mentioned

Answer: Option 'A'

delayed until run time

  • 4. Dynamic loading is :
   A.) loading multiple routines dynamically
   B.) loading a routine only when it is called
   C.) loading multiple routines randomly
   D.) none of the mentioned

Answer: Option 'B'

loading a routine only when it is called

  • 5. The advantage of dynamic loading is that :
   A.) A used routine is used multiple times
   B.) An unused routine is never loaded
   C.) CPU utilization increases
   D.) All of the mentioned

Answer: Option 'B'

An unused routine is never loaded

  • 6. The idea of overlays is to :
   A.) data that are needed at any given time
   B.) enable a process to be larger than the amount of memory allocated to it
   C.) keep in memory only those instructions
   D.) all of the mentioned

Answer: Option 'D'

all of the mentioned

  • 7. The ___________ must design and program the overlay structure.
   A.) programmer
   B.) system architect
   C.) system designer
   D.) none of the mentioned

Answer: Option 'A'

programmer

  • 8. The ___________ swaps processes in and out of the memory.
   A.) Memory manager
   B.) CPU
   C.) CPU manager
   D.) User

Answer: Option 'A'

Memory manager

  • 9. 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 :
   A.) priority swapping
   B.) pull out, push in
   C.) roll out, roll in
   D.) none of the mentioned

Answer: Option 'C'

roll out, roll in

  • 10. If binding is done at assembly or load time, then the process _____ be moved to different locations after being swapped out and in again.
   A.) can
   B.) must
   C.) can never
   D.) may

Answer: Option 'C'

can never

  • 11. In a system that does not support swapping,
   A.) the compiler normally binds symbolic addresses (variables) to relocatable addresses
   B.) the compiler normally binds symbolic addresses to physical addresses
   C.) the loader binds relocatable addresses to physical addresses
   D.) binding of symbolic addresses to physical addresses normally takes place during execution

Answer: Option 'A'

the compiler normally binds symbolic addresses (variables) to relocatable addresses

  • 12. Which of the following is TRUE ?
   A.) Overlays are used to increase the size of physical memory
   B.) Overlays are used to increase the logical address space
   C.) When overlays are used, the size of a process is not limited to the size of the physical memory
   D.) Overlays are used whenever the physical address space is smaller than the logical address space

Answer: Option 'C'

When overlays are used, the size of a process is not limited to the size of the physical memory



Memory Management Swapping Processes 1 Download Pdf