The mechanism that bring a page into memory only when it is needed is called Seg

Question

The mechanism that bring a page into memory only when it is needed is called Segmentation Fragmentation Demand Paging Page Replacement FIFO scheduling is_______. Preemptive Scheduling Non Preemptive Scheduling Deadline Scheduling Fair share scheduling Switching the CPU to another process requires to save state of the old process and loading new process state is called as_______. Process Blocking Context Switch Time Sharing None of the above Which directory implementation is used in most Operating System? Single level directory structure Two level directory structure Tree directory structure A cyclic directory structure The Banker's algorithm is used to prevent deadlock in operating systems to detect deadlock in operating systems to rectify a deadlocked state none of the above A thread is a lightweight process where the context switching is low is a lightweight process where the context switching is high is used to speed up paging none of the above

Explanation / Answer

Q 12. 2. Throughput.

Q 13. 1. Deaklock.

Q 14. 4. BAK

Q 15. 2. Is a region prone to deadlock.

Q 16. 3. Demand Paging.

Q 17. 2. Non-preemptive Scheduling.

Q 18. 2. Context Switch.

Q 19. 3. Tree directory structure.

Q 20. 1. To prevent deadlock in operating system.

Related Questions

Navigate

• Browse (All)
• Browse T
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.