Top 250+ Solved Operating System Advanced MCQ Questions Answer
Q. In two level scheme for page table, if one assume byte-level addressing and 4-kbyte (212 pages) then the 4-Gbyte (232) virtual address space is composed of
a. 210 pages
b. 220 pages
c. 230 pages
d. 240 pages
Q. When pre cleaning policy is applied inmemory management
a. A page is written out to secondary memory only when it has been selected for replacement.
b. Modified pages are written before their page frames are needed so that can be written out in batches.
c. A and B both true.
d. None of these.
Q. In virtual memory management, when local control policy is applied
a. It determines the number of processes that are to be resident in main memory.
b. It determines the number of processes that are to be resident in virtual memory.
c. It determines when a modified page should be written out to secondary memory.
d. None of these.
Q. In two level scheme if each page is mapped by 4-byte (22) page table entry then to create a page table composed of 220 page table entry one requires
a. 222 bytes
b. 212 bytes
c. 216 bytes
d. None of these.
Q. In defining page table structure in virtual memory, A page number portion of a virtual address is mapped into a hash table using simple hash function, where hash table contains a pointer to the inverted page table, which contains page table entries, this approach is referred as
a. One page table per process structure.
b. Two level page table structure.
c. Inverted page table structure.
d. None of these.
Q. A fetch policy for virtual memory determines
a. When a page should be bought into main memory.
b. Where in real memory a process piece is to be reside.
Q. When process is swapped out of main memory and put in a suspended state
a. All of its resident pages are moved out.
b. All of the pages that were previously in main memory are returned to main memory.
c. Pages other than the one demanded by a page fault are bought in main memory.
d. None of these.
Q. Statement A: The placement policy determines where in real memory a process piece is to reside. Statement B: The fetch policy determines when a page should be bought into main memory.
a. A and B both true
b. A and B both false
c. A is true, B is false
d. A is false, B is true
Q. When a frame in main memory is locked
a. The page currently stored in that frame can be replaced.
b. The page currently stored in that frame cannot be replaced.
c. Pages currently in frame can be removed in round-robin style.
d. None of these.
Q. Statement A : In memory management, the replacement policy deals with the selection of pages in memory to be replaced by arrived new page. Statement B: In memory management, the policy the fetch policy determines when a page should be bought into main memory.
a. A and B both false
b. A and B both true
c. A is true, B is false
d. A is false, B is true
Q. In memory management where replacement is allowed in First-in-First-out (FIFO) fashion
a. The page frames are allocated to a process as circular buffer and pages are removed in random order.
b. The page frames are allocated to a process as circular buffer and pages are removed in round-robin order.
Q. By principle of locality, in least recently used policy, in memory management
a. The page replaced in memory is least likely to be referenced in the near future.
b. The page replaced in memory is most likely to be referenced in the near future.
c. The pages replaced in memory in round-robin fashion.
d. None of these.
Q. In First-In-First-out (FIFO) replacement policy used in memory management, the page frames to allocated to a process as circular buffer and
a. The most recent page is removed at first
b. The most recent page is removed at the last
c. The most recent page is removed any time
d. None of these
Q. In memory management Free page list is: A- A list of page frames available for reading in pages. B- A list where replaced page is assigned without modification. C-A list where replaced page is assigned with modification.
a. A, B, C are true
b. A and B are true
c. A and C are true
d. B and C are true.