Virtual Memory MCQ

Test your knowledge with important Virtual Memory MCQ and their applications. These MCQs are beneficial for competitive exams too. Explore 30 + more Virtual Memory MCQs at Bissoy

• ________ replacement generally results in greater system throughput.
  ক

  Local

  খ

  Global

  গ

  Universal

  ঘ

  Public
• One problem with the global replacement algorithm is that ____________
  ক

  it is very expensive

  খ

  many frames can be allocated to a process

  গ

  only a few frames can be allocated to a process

  ঘ

  a process cannot control its own page – fault rate
• _________ replacement allows each process to only select from its own set of allocated frames.
  ক

  Local

  খ

  Universal

  গ

  Global

  ঘ

  Public
• _________ replacement allows a process to select a replacement frame from the set of all frames, even if the frame is currently allocated to some other process.
  ক

  Local

  খ

  Universal

  গ

  Global

  ঘ

  Public
• With either equal or proportional algorithm, a high priority process is treated ___________ a low priority process.
  ক

  greater than

  খ

  same as

  গ

  lesser than

  ঘ

  none of the mentioned
• The algorithm in which we allocate memory to each process according to its size is known as ____________
  ক

  proportional allocation algorithm

  খ

  equal allocation algorithm

  গ

  split allocation algorithm

  ঘ

  none of the mentioned
• The algorithm in which we split m frames among n processes, to give everyone an equal share, m/n frames is known as ____________
  ক

  proportional allocation algorithm

  খ

  equal allocation algorithm

  গ

  split allocation algorithm

  ঘ

  none of the mentioned
• The maximum number of frames per process is defined by ____________
  ক

  the amount of available physical memory

  খ

  operating System

  গ

  instruction set architecture

  ঘ

  none of the mentioned
• Consider a machine in which all memory reference instructions have only one memory address, for them we need at least _____ frame(s).
  ক

  one

  খ

  two

  গ

  three

  ঘ

  none of the mentioned
• When a page fault occurs before an executing instruction is complete if ____________
  ক

  the instruction must be restarted

  খ

  the instruction must be ignored

  গ

  the instruction must be completed ignoring the page fault

  ঘ

  none of the mentioned
• The minimum number of frames to be allocated to a process is decided by the ____________
  ক

  the amount of available physical memory

  খ

  operating System

  গ

  instruction set architecture

  ঘ

  none of the mentioned
• Consider the following page reference string. 1 2 3 4 2 1 5 6 2 1 2 3 7 6 3 2 1 2 3 6 For Optimal page replacement algorithms with 3 frames, the number of page faults is?
  ক

  16

  খ

  15

  গ

  14

  ঘ

  11
• Consider the following page reference string. 1 2 3 4 2 1 5 6 2 1 2 3 7 6 3 2 1 2 3 6 For FIFO page replacement algorithms with 4 frames, the number of page faults is?
  ক

  16

  খ

  15

  গ

  14

  ঘ

  11
• Consider the following page reference string. 1 2 3 4 2 1 5 6 2 1 2 3 7 6 3 2 1 2 3 6 For FIFO page replacement algorithms with 3 frames, the number of page faults is?
  ক

  16

  খ

  15

  গ

  14

  ঘ

  11
• Consider the following page reference string. 1 2 3 4 2 1 5 6 2 1 2 3 7 6 3 2 1 2 3 6 For LRU page replacement algorithm with 5 frames, the number of page faults is?
  ক

  10

  খ

  14

  গ

  8

  ঘ

  11
• Consider the following page reference string. 1 2 3 4 2 1 5 6 2 1 2 3 7 6 3 2 1 2 3 6 For LRU page replacement algorithm with 4 frames, the number of page faults is?
  ক

  10

  খ

  14

  গ

  8

  ঘ

  11
• If working set window is too large ____________
  ক

  it will not encompass entire locality

  খ

  it may overlap several localities

  গ

  it will cause memory problems

  ঘ

  none of the mentioned
• If working set window is too small ____________
  ক

  it will not encompass entire locality

  খ

  it may overlap several localities

  গ

  it will cause memory problems

  ঘ

  none of the mentioned
• The accuracy of the working set depends on the selection of ____________
  ক

  working set model

  খ

  working set size

  গ

  memory size

  ঘ

  number of pages in memory
• In the working set model, for: 2 6 1 5 7 7 7 7 5 1 6 2 3 4 1 2 3 4 4 4 3 4 3 4 4 4 1 3 2 3 if DELTA = 10, then the working set at time t1 (….7 5 1) is?
  ক

  {1, 2, 4, 5, 6}

  খ

  {2, 1, 6, 7, 3}

  গ

  {1, 6, 5, 7, 2}

  ঘ

  {1, 2, 3, 4, 5}
• A program is generally composed of several different localities, which _____ overlap.
  ক

  may

  খ

  must

  গ

  do not

  ঘ

  must not
• When a subroutine is called ____________
  ক

  it defines a new locality

  খ

  it is in the same locality from where it was called

  গ

  it does not define a new locality

  ঘ

  none of the mentioned
• What is a locality?
  ক

  a set of pages that are actively used together

  খ

  a space in memory

  গ

  an area near a set of processes

  ঘ

  none of the mentioned
• Thrashing _______ the CPU utilization.
  ক

  increases

  খ

  keeps constant

  গ

  decreases

  ঘ

  none of the mentioned
• Working set model for page replacement is based on the assumption of ____________
  ক

  modularity

  খ

  locality

  গ

  globalization

  ঘ

  random access
• A process is thrashing if ____________
  ক

  it is spending more time paging than executing

  খ

  it is spending less time paging than executing

  গ

  page fault occurs

  ঘ

  swapping can not take place
• Which algorithm chooses the page that has not been used for the longest period of time whenever the page required to be replaced?
  ক

  first in first out algorithm

  খ

  additional reference bit algorithm

  গ

  least recently used algorithm

  ঘ

  counting based page replacement algorithm
• In FIFO page replacement algorithm, when a page must be replaced ____________
  ক

  oldest page is chosen

  খ

  newest page is chosen

  গ

  random page is chosen

  ঘ

  none of the mentioned
• Effective access time is directly proportional to ____________
  ক

  page-fault rate

  খ

  hit ratio

  গ

  memory access time

  ঘ

  none of the mentioned
• When a program tries to access a page that is mapped in address space but not loaded in physical memory, then ____________
  ক

  segmentation fault occurs

  খ

  fatal error occurs

  গ

  page fault occurs

  ঘ

  no error occurs