Home / CSE MCQs / OS MCQs :: Memory Management - Operating System

CSE MCQs :: OS MCQs

  1. The operating system is :
  2. A.
    in the low memory
    B.
    in the high memory
    C.
    either a or b (depending on the location of interrupt vector)
    D.
    None of these

  3. In contiguous memory allocation :
  4. A.
    each process is contained in a single contiguous section of memory
    B.
    all processes are contained in a single contiguous section of memory
    C.
    the memory space is contiguous
    D.
    None of these

  5. The relocation register helps in :
  6. A.
    providing more address space to processes
    B.
    a different address space to processes
    C.
    to protect the address spaces of processes
    D.
    None of these

  7. With relocation and limit registers, each logical address must be _______ the limit register.
  8. A.
    less than
    B.
    equal to
    C.
    greater than
    D.
    None of these

  9. The operating system and the other processes are protected from being modified by an already running process because :
  10. A.
    they are in different memory spaces
    B.
    they are in different logical addresses
    C.
    they have a protection algorithm
    D.
    every address generated by the CPU is being checked against the relocation and limit registers

  11. Transient operating system code is code that :
  12. A.
    is not easily accessible
    B.
    comes and goes as needed
    C.
    stays in the memory always
    D.
    never enters the memory space

  13. Using transient code, _______ the size of the operating system during program execution.
  14. A.
    increases
    B.
    decreases
    C.
    changes
    D.
    maintains

  15. When memory is divided into several fixed sized partitions, each partition may contain ________.
  16. A.
    exactly one process
    B.
    atleast one process
    C.
    multiple processes at once
    D.
    None of these

  17. In fixed sized partition, the degree of multiprogramming is bounded by ___________.
  18. A.
    the number of partitions
    B.
    the CPU utilization
    C.
    the memory size
    D.
    All of these

  19. The first fit, best fit and worst fit are strategies to select a ______.
  20. A.
    process from a queue to put in memory
    B.
    processor to run the next process
    C.
    free hole from a set of available holes
    D.
    All of these