Multiple Choice
When there is a large logical address space, the best way of paging would be
A) not to page
B) a two level paging algorithm
C) the page table itself
D) all of the mentioned
Correct Answer:
Verified
Correct Answer:
Verified
Q4: Each entry in a translation lookaside buffer
Q5: Smaller page tables are implemented as a
Q6: Time taken in memory access through PTBR
Q7: An_ uniquely identifies processes and is used to
Q8: For every process there is a_ <br>A)page table<br>B)copy
Q10: Paging increases the_ time.<br>A)waiting<br>B)execution<br>C)context - switch<br>D)all of the
Q11: _is the concept in which a process
Q12: Swap space exists in_<br>A)primary memory<br>B)secondary memory<br>C)cpu<br>D)none of
Q13: In FIFO page replacement algorithm, when a
Q14: The operating system maintains a_ table that