On This Page

This set of Operating System (OS) Multiple Choice Questions & Answers (MCQs) focuses on Operating System Set 17

Q1 | The                      is used as an index into the page table.
  • frame bit
  • page number
  • page offset
  • frame offset
Q2 | The            table contains the base address of each page in physical memory.
  • process
  • memory
  • page
  • frame
Q3 | The size of a page is typically
  • varied
  • power of 2
  • power of 4
  • none of the mentioned
Q4 | 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
Q5 | The operating system maintains a               table that keeps track of how many frames have been allocated, how many are there, and how many are available.
  • page
  • mapping
  • frame
  • memory
Q6 | Paging increases the              time.
  • waiting
  • execution
  • context – switch
  • all of the mentioned
Q7 | Smaller page tables are implemented as a set of                
  • queues
  • stacks
  • counters
  • registers
Q8 | The page table registers should be built with                
  • very low speed logic
  • very high speed logic
  • a large memory space
  • none of the mentioned
Q9 | 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
Q10 | For every process there is a                      
  • page table
  • copy of page table
  • pointer to page table
  • all of the mentioned
Q11 | 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
Q12 | Each entry in a translation lookaside buffer (TLB) consists of                          
  • key
  • value
  • bit value
  • constant
Q13 | 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
Q14 | 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
Q15 | 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
Q16 | 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
Q17 | 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
Q18 | 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
Q19 |            is the concept in which a process is copied into the main memory from the secondary memory according to the requirement.
  • paging
  • demand paging
  • segmentation
  • swapping
Q20 | The pager concerns with the
  • special support from hardware is required                          
  • special support from operating system is essential
  • special support from both hardware and operating system is essential
  • user programs can implement dynamic loading without any special support from hardware or operating system
Q21 | 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
Q22 | Swap space exists in                          
  • primary memory
  • secondary memory
  • cpu
  • none of the mentioned
Q23 | 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
Q24 | Effective access time is directly proportional to                          
  • page-fault rate
  • hit ratio
  • memory access time
  • none of the mentioned
Q25 | 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