Demand Paging MCQ

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

• Locality of reference implies that the page reference being made by a process ____________
  ক

  will always be to the page used in the previous page reference

  খ

  is likely to be one of the pages used in the last few page references

  গ

  will always be one of the pages existing in memory

  ঘ

  will always lead to page faults
• When the page fault rate is low ____________
  ক

  the turnaround time increases

  খ

  the effective access time increases

  গ

  the effective access time decreases

  ঘ

  turnaround time & effective access time increases
• If the memory access time is denoted by ‘ma’ and ‘p’ is the probability of a page fault (0 <= p <= 1). Then the effective access time for a demand paged memory is ____________
  ক

  p x ma + (1-p) x page fault time

  খ

  ma + page fault time

  গ

  (1-p) x ma + p x page fault time

  ঘ

  none of the mentioned
• When a process begins execution with no pages in memory?
  ক

  process execution becomes impossible

  খ

  a page fault occurs for every page brought into memory

  গ

  process causes system crash

  ঘ

  none of the mentioned
• When a page fault occurs, the state of the interrupted process is ____________
  ক

  disrupted

  খ

  invalid

  গ

  saved

  ঘ

  none of the mentioned
• A page fault occurs when?
  ক

  a page gives inconsistent data

  খ

  a page cannot be accessed due to its absence from memory

  গ

  a page is invisible

  ঘ

  all of the mentioned
• The valid – invalid bit, in this case, when valid indicates?
  ক

  the page is not legal

  খ

  the page is illegal

  গ

  the page is in memory

  ঘ

  the page is not in memory
• Using a pager ____________
  ক

  increases the swap time

  খ

  decreases the swap time

  গ

  decreases the swap time & amount of physical memory needed

  ঘ

  increases the amount of physical memory needed
• A swapper manipulates ___________ whereas the pager is concerned with individual _______ of a process.
  ক

  the entire process, parts

  খ

  all the pages of a process, segments

  গ

  the entire process, pages

  ঘ

  none of the mentioned
• Segment replacement algorithms are more complex than page replacement algorithms because ____________
  ক

  Segments are better than pages

  খ

  Pages are better than segments

  গ

  Segments have variable sizes

  ঘ

  Segments have fixed sizes
• Virtual memory is normally implemented by ________
  ক

  demand paging

  খ

  buses

  গ

  virtualization

  ঘ

  all of the mentioned
• In virtual memory. the programmer __________ of overlays.
  ক

  has to take care

  খ

  does not have to take care

  গ

  all of the mentioned

  ঘ

  none of the mentioned
• The ability to execute a program that is only partially in memory has benefits like ____________
  ক

  The amount of physical memory cannot put a constraint on the program

  খ

  Programs for an extremely large virtual space can be created

  গ

  Throughput increases

  ঘ

  All of the mentioned
• Error handler codes, to handle unusual errors are ____________
  ক

  almost never executed

  খ

  executed very often

  গ

  executed periodically

  ঘ

  none of the mentioned
• The instruction being executed, must be in ____________
  ক

  physical memory

  খ

  logical memory

  গ

  physical & logical memory

  ঘ

  none of the mentioned
• Virtual memory allows ____________
  ক

  execution of a process that may not be completely in memory

  খ

  a program to be smaller than the physical memory

  গ

  a program to be larger than the secondary storage

  ঘ

  execution of a process without being in physical memory