Q. The size of a page is typically :

View solution

Q. 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.

View solution

Q. With paging there is no ________ fragmentation.

View solution

Q. 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.

View solution

Q. Paging increases the ______ time.

View solution

Q. Smaller page tables are implemented as a set of _______

View solution

Q. The page table registers should be built with _______

View solution

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

View solution

Q. For every process there is a __________

View solution

Q. Time taken in memory access through PTBR is :

View solution

Q. Each entry in a Translation look-aside buffer (TLB) consists of :

View solution

Q. If a page number is not found in the TLB, then it is known as a :

View solution

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

View solution

Q. The percentage of times a page number is found in the TLB is known as :

View solution

Q. Memory protection in a paged environment is accomplished by :

View solution

Q. When the valid – invalid bit is set to valid, it means that the associated page :

View solution

Q. Illegal addresses are trapped using the _____ bit.

View solution

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

View solution

Q. 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 :

View solution

Q. To obtain better memory utilization, dynamic loading is used. With dynamic loading, a routine is not loaded until it is called. For implementing dynamic loading,

View solution