Home / CSE MCQs / OS MCQs :: Virtual memory - Operating System

CSE MCQs :: OS MCQs

  1. Because of virtual memory, the memory can be shared among:
  2. A.
    processes
    B.
    threads
    C.
    instructions
    D.
    none of the mentioned

    View Answer

    Workspace

    Discuss Discuss in Forum


  3. _____ is the concept in which a process is copied into main memory from the secondary memory according to the requirement.
  4. A.
    Paging
    B.
    Demand paging
    C.
    Segmentation
    D.
    Swapping

    View Answer

    Workspace

    Discuss Discuss in Forum


  5. The pager concerns with the:
  6. A.
    individual page of a process
    B.
    entire process
    C.
    entire thread
    D.
    first page of a process

    View Answer

    Workspace

    Discuss Discuss in Forum


  7. Swap space exists in:
  8. A.
    primary memory
    B.
    secondary memory
    C.
    CPU
    D.
    none of the mentioned

    View Answer

    Workspace

    Discuss Discuss in Forum


  9. When a program tries to access a page that is mapped in address space but not loaded in physical memory, then?
  10. A.
    segmentation fault occurs
    B.
    fatal error occurs
    C.
    page fault occurs
    D.
    no error occurs

    View Answer

    Workspace

    Discuss Discuss in Forum


  11. Effective access time is directly proportional to:
  12. A.
    page-fault rate
    B.
    hit ratio
    C.
    memory access time
    D.
    none of the mentioned

    View Answer

    Workspace

    Discuss Discuss in Forum


  13. In FIFO page replacement algorithm, when a page must be replaced:
  14. A.
    oldest page is chosen
    B.
    newest page is chosen
    C.
    random page is chosen
    D.
    none of the mentioned

    View Answer

    Workspace

    Discuss Discuss in Forum


  15. Which algorithm chooses the page that has not been used for the longest period of time whenever the page required to be replaced?
  16. A.
    first in first out algorithm
    B.
    additional reference bit algorithm
    C.
    least recently used algorithm
    D.
    counting based page replacement algorithm

    View Answer

    Workspace

    Discuss Discuss in Forum


  17. A process is thrashing if:
  18. A.
    it is spending more time paging than executing
    B.
    it is spending less time paging than executing
    C.
    page fault occurs
    D.
    swapping can not take place

    View Answer

    Workspace

    Discuss Discuss in Forum


  19. Working set model for page replacement is based on the assumption of:
  20. A.
    modularity
    B.
    locality
    C.
    globalization
    D.
    random access

    View Answer

    Workspace

    Discuss Discuss in Forum