What test you know about operating system P11

Please read your knowledge and the following multiple choice questions of Network Administrator. Hope with these questions will give you lots of useful information.
  1. Question 1. The actual address that the memory manager sees and manipulates is:
    1. Logical address
    2. Address space

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