Memory Management MCQ

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

• In paged memory systems, if the page size is increased, then the internal fragmentation generally ____________
  ক

  becomes less

  খ

  becomes more

  গ

  remains constant

  ঘ

  none of the mentioned
• In a paged memory, the page hit ratio is 0.35. The required to access a page in secondary memory is equal to 100 ns. The time required to access a page in primary memory is 10 ns. The average time required to access a page is?
  ক

  3.0 ns

  খ

  68.0 ns

  গ

  68.5 ns

  ঘ

  78.5 ns
• When there is a large logical address space, the best way of paging would be ____________
  ক

  not to page

  খ

  a two level paging algorithm

  গ

  the page table itself

  ঘ

  all of the mentioned
• Illegal addresses are trapped using the _____ bit.
  ক

  error

  খ

  protection

  গ

  valid – invalid

  ঘ

  access
• When the valid – invalid bit is set to valid, it means that the associated page ____________
  ক

  is in the TLB

  খ

  has data in it

  গ

  is in the process’s logical address space

  ঘ

  is the system’s physical address space
• Memory protection in a paged environment is accomplished by ____________
  ক

  protection algorithm with each page

  খ

  restricted access rights to users

  গ

  restriction on page visibility

  ঘ

  protection bit with each page
• The percentage of times a page number is found in the TLB is known as ____________
  ক

  miss ratio

  খ

  hit ratio

  গ

  miss percent

  ঘ

  none of the mentioned
• An ______ uniquely identifies processes and is used to provide address space protection for that process.
  ক

  address space locator

  খ

  address space identifier

  গ

  address process identifier

  ঘ

  none of the mentioned
• If a page number is not found in the TLB, then it is known as a ____________
  ক

  TLB miss

  খ

  Buffer miss

  গ

  TLB hit

  ঘ

  All of the mentioned
• Each entry in a translation lookaside buffer (TLB) consists of ____________
  ক

  key

  খ

  value

  গ

  bit value

  ঘ

  constant
• Time taken in memory access through PTBR is ____________
  ক

  extended by a factor of 3

  খ

  extended by a factor of 2

  গ

  slowed by a factor of 3

  ঘ

  slowed by a factor of 2
• For every process there is a __________
  ক

  page table

  খ

  copy of page table

  গ

  pointer to page table

  ঘ

  all of the mentioned
• For larger page tables, they are kept in main memory and a __________ points to the page table.
  ক

  page table base register

  খ

  page table base pointer

  গ

  page table register pointer

  ঘ

  page table base
• The page table registers should be built with _______
  ক

  very low speed logic

  খ

  very high speed logic

  গ

  a large memory space

  ঘ

  none of the mentioned
• Smaller page tables are implemented as a set of _______
  ক

  queues

  খ

  stacks

  গ

  counters

  ঘ

  registers
• Paging increases the ______ time.
  ক

  waiting

  খ

  execution

  গ

  context – switch

  ঘ

  all of the mentioned
• With paging there is no ________ fragmentation.
  ক

  internal

  খ

  external

  গ

  either type of

  ঘ

  none of the mentioned
• If the size of logical address space is 2 to the power of m, and a page size is 2 to the power of n addressing units, then the high order _____ bits of a logical address designate the page number, and the ____ low order bits designate the page offset.
  ক

  m, n

  খ

  n, m

  গ

  m – n, m

  ঘ

  m – n, n
• The size of a page is typically ____________
  ক

  varied

  খ

  power of 2

  গ

  power of 4

  ঘ

  none of the mentioned
• The _____ table contains the base address of each page in physical memory.
  ক

  process

  খ

  memory

  গ

  page

  ঘ

  frame
• The __________ is used as an index into the page table.
  ক

  frame bit

  খ

  page number

  গ

  page offset

  ঘ

  frame offset
• Every address generated by the CPU is divided into two parts. They are ____________
  ক

  frame bit & page number

  খ

  page number & page offset

  গ

  page offset & frame bit

  ঘ

  frame offset & page offset
• Logical memory is broken into blocks of the same size called _________
  ক

  frames

  খ

  pages

  গ

  backing store

  ঘ

  none of the mentioned
• Physical memory is broken into fixed-sized blocks called ________
  ক

  frames

  খ

  pages

  গ

  backing store

  ঘ

  none of the mentioned
• In a system that does not support swapping ____________
  ক

  the compiler normally binds symbolic addresses (variables) to relocatable addresses

  খ

  the compiler normally binds symbolic addresses to physical addresses

  গ

  the loader binds relocatable addresses to physical addresses

  ঘ

  binding of symbolic addresses to physical addresses normally takes place during execution
• If binding is done at assembly or load time, then the process _____ be moved to different locations after being swapped out and in again.
  ক

  can

  খ

  must

  গ

  can never

  ঘ

  may
• If a higher priority process arrives and wants service, the memory manager can swap out the lower priority process to execute the higher priority process. When the higher priority process finishes, the lower priority process is swapped back in and continues execution. This variant of swapping is sometimes called?
  ক

  priority swapping

  খ

  pull out, push in

  গ

  roll out, roll in

  ঘ

  none of the mentioned
• The ___________ swaps processes in and out of the memory.
  ক

  Memory manager

  খ

  CPU

  গ

  CPU manager

  ঘ

  User
• The ___________ must design and program the overlay structure.
  ক

  programmer

  খ

  system architect

  গ

  system designer

  ঘ

  none of the mentioned
• The idea of overlays is to ____________
  ক

  data that are needed at any given time

  খ

  enable a process to be larger than the amount of memory allocated to it

  গ

  keep in memory only those instructions

  ঘ

  all of the mentioned