Exam 17: Understanding Paging and Memory Management in Operating Systems

The percentage of times a page number is found in the TLB is known as___________

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

Memory protection in a paged environment is accomplished by___________

Each entry in a translation lookaside buffer (TLB) consists of___________

Smaller page tables are implemented as a set of___________

Time taken in memory access through PTBR is___________

An___________  uniquely identifies processes and is used to provide address space protection for that process.

For every process there is a___________      

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

Paging increases the___________  time.

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

Swap space exists in___________

In FIFO page replacement algorithm, when a page must be replaced___________

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.

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

The___________      is used as an index into the page table.

The page table registers should be built with___________

The size of a page is typically

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

Effective access time is directly proportional to___________