Operating System Basics Questions and Answers

Practice Mode
Showing 10 of 563 questions
Q371
A fetch polocy 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
  • C The selection of a page in memory that is to replaced
  • D The page in memory that is not been reference for long time.
Answer: Option A
Q372
The demand paging and pre paging of virtual memory management are
  • A Fetch policy for virtual memory management.
  • B Placement policy for virtual memory management.
  • C Replacement policy for virtual memory management.
  • D None of these
Answer: Option A
Q373
When process is swapped out of main memory and put in a suspenede 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.
Answer: Option A
Q374
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 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
Answer: Option A
Q375
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
Answer: Option B
Q376
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 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
Answer: Option B
Q377
The least recently Used (LRU) policy
  • A Replaces the page in memory that has not been referenced for the least time.
  • B Replace the page in memory that has not been referenced for the longest time.
  • C Replaces the page in memory in round robbin fashion
  • D None of these
Answer: Option B
Q378
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 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.
  • C Replaces the pages that are most referred.
  • D Replaces the pages that are most referred.
Answer: Option B
Q379
By prinipl 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 replacedin memory is most likely to be referenced in the near future.
  • C The pages replaced in memory in rount-robin fashion.
  • D None of these
Answer: Option A
Q380
In First-in-First-out(FIFO) replacement policy used in memry management, the page frames to allocated to 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
Answer: Option B

📚 More from Technical

← All Topics 🎯 Practice ⏱️ Take Test 🔍 Search
Technical
Back to Technical
Other Subjects
Questions and Answers for Competitive Exams Various Entrance Test