Basic Operating System MCQ
Basic Operating System MCQ
371. A fetch polocy for virtual memory determines
- When a page should be bought into main memory.
- where in real memory a process piece is to be reside
- The selection of a page in memory that is to replaced
- The page in memory that is not been reference for long time.
372. The demand paging and pre paging of virtual memory management are
- Fetch policy for virtual memory management.
- Placement policy for virtual memory management.
- Replacement policy for virtual memory management.
- None of these
373. When process is swapped out of main memory and put in a suspenede state
- All of its resident pages are moved out.
- All of the pages that were previously in main memory are returned to main memory
- Pages other than the one demanded by a page fault are bought in main memory.
- None of these.
374. 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 shoud be bought into main memory.
- A and B both true
- A and B both false
- A is true, B is false
- A is false, B is true
375. When a frame in main memory is locked
- The page currently stored in that frame can be replaced.
- The page currently stored in that frame cannot be replaced
- Pages currently in frame can be removed in round-robin style.
- None of these
376. Statement A: In memory management, the replacement polcy deals with the selection of pages in memory to be replaced by arrived new page. Statement B: In memory management, the policy the fetch Polocy determines when a page should be bought into main memory.
- A and B both false
- A and B both true
- A is true, B is false
- A is false, B is true
377. The least recently Used (LRU) policy
- Replaces the page in memory that has not been referenced for the least time.
- Replace the page in memory that has not been referenced for the longest time.
- Replaces the page in memory in round robbin fashion
- None of these
378. In memory management where replacement is allowed in First-in-First-out(FIFO) fashion
- The page frames are allocated to a process as circular buffer and pages process as circular buffer and pages are removed in random order.
- The page frames are allocated to a process as circular buffer and pages are removed in round-robin order.
- Replaces the pages that are most referred.
- Replaces the pages that are most referred.
379. By prinipl of locality, in least recently used policy. in memory management
- The page replaced in memory is least likely to be referenced in the near future.
- The page replacedin memory is most likely to be referenced in the near future.
- The pages replaced in memory in rount-robin fashion.
- None of these
380. In First-in-First-out(FIFO) replacement policy used in memry management, the page frames to allocated to process as circular buffer and
- the most recent page is removed at first
- The most recent page is removed at the last
- The most recent page is removed any time
- None of these