Operating System Set 17

Q1 | The                      is used as an index into the page table.

Q2 | The            table contains the base address of each page in physical memory.

Q3 | The size of a page is typically

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.

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.

Q6 | Paging increases the              time.

Q7 | Smaller page tables are implemented as a set of                

Q8 | The page table registers should be built with                

Q9 | For larger page tables, they are kept in main memory and a                      points to the page table.

Q10 | For every process there is a                      

Q11 | Time taken in memory access through PTBR is                          

Q12 | Each entry in a translation lookaside buffer (TLB) consists of                          

Q13 | If a page number is not found in the TLB, then it is known as a                          

Q14 | An              uniquely identifies processes and is used to provide address space protection for that process.

Q15 | The percentage of times a page number is found in the TLB is known as                          

Q16 | Memory protection in a paged environment is accomplished by                          

Q17 | When the valid – invalid bit is set to valid, it means that the associated page

Q18 | When there is a large logical address space, the best way of paging would be

Q19 |            is the concept in which a process is copied into the main memory from the secondary memory according to the requirement.

Q20 | The pager concerns with the

Q21 | In paged memory systems, if the page size is increased, then the internal fragmentation generally                          

Q22 | Swap space exists in                          

Q23 | When a program tries to access a page that is mapped in address space but not loaded in physical memory, then                          

Q24 | Effective access time is directly proportional to                          

Q25 | In FIFO page replacement algorithm, when a page must be replaced