Q. Locality of reference implies that the page reference being made by a process __________.
Q. The process of assigning load addresses to the various parts of the program and adjusting the code and data in the program to reflect the assigned addresses is called?
Q. Consider a virtual memory system with FIFO page replacement policy. For an arbitrary page access pattern, increasing the number of page frames in main memory will __________.
Q. Which of the following is not a form of memory?
Q. The Optimal Page Replacement algorithm will select the page that __________.
Q. Dynamic linking can cause security concerns because __________.
Q. Consider a machine with 64 MB physical memory and a 32 bit virtual address space. If the page size is 4 KB, what is the approximate size of the page table?
Q. In a system with 32 bit virtual address and 1 KB page size, use of one-level page tables for virtual to physical address translation is not practical because of __________.
Q. Which of the following is not an advantage of using shared, dynamically linked libraries as opposed to using statically linked libraries?
Q. Consider a program P that consists of two source modules M1 and M2 contained in two different files. If M1 contains a reference to a function defined in M2, the reference will be resolved at __________.
Q. The minimum number of page frames that must be allocated to a running process in a virtual memory environment is determined by __________.
Q. What is the use of swap space in a disk?
Q. How many 32K x 1 RAM chips are needed to provide a memory capacity of 256 K-Bytes?
Q. Which of the following addressing modes are suitable for program relocation at runtime?
| 1) Absolute addressing |
| 2) Based addressing |
| 3) Relative addressing |
| 4) Indirect addressing |
Q. Which of the following is not a valid Deadlock prevention scheme?
