What Test You Know About Operating System P11?

This article presents What Test You Know About Operating System P11 in a clear, structured format. It helps readers review key concepts, test their understanding, and learn from the material.

Understanding What Test You Know About Operating System P11

• Question 1. The actual address that the memory manager sees and manipulates is:
  • Logical address

  • Address space

  • Physical address
• Question 2. Gather all virtual addresses generated by a program called:
  • Logical address
  • Address space
  • Physical space
• Question 3. At what point does the following process work only on virtual addresses, never physical addresses?
  • Time of processing
  • Time of translation
  • Load time
• Question 4. In continuous memory allocation for the process, which model allows moving the process in memory after loading.
  • Base-Limit model
  • Linker-Loader model
  • Both sentences are true
• Question 5. The algorithm chooses a blank segment to satisfy the demand for a process (in the memory segment)
  • First-fit
  • Worst-fit
  • Best-fit
  • No sentence is correct
• Question 6. The fragmentation phenomenon is.
  • The memory area is divided into discontinuous regions.
  • Empty memory space is gathered from discrete small pieces of memory.
  • The total memory space is sufficient to satisfy the demand, but the memory areas are not continuous, which is not enough to grant another process.
  • No sentence is correct
• Question 7. In memory allocation technique, a virtual address segment is represented by:
  • The setwhere s is the segment number, d is the relative address in s.
  • The setWith base as a background index, limit is a limit indicator.
  • No answer right
• Question 8. With logical addressand STBR background register, the physical address limit STLR register is calculated corresponding to the logical address:
  • STBR + s + d
  • STLR -sd
  • STLR- STBR + s + d
• Question 9. The first algorithm to select the empty space is large enough to load the process:
  • Best-fit
  • Worst-fit
  • First-fit
• Question 10. The algorithm to select the smallest free-space free space but large enough to load the process is:
  • First-fit
  • Worst-fit
  • Best-fit